﻿2019图论、运筹与控制小型研讨会-中南大学数学与统计学院

2019图论、运筹与控制小型研讨会

2019图论、运筹与控制小型研讨会

 时间 内容 主持人 10月12日8:40-9:40 报告题目：Some spectral extremal   results for hypergraphs报 告 人：常安（福州大学）报告摘要：Let F be a graph. A hypergraph is called Berge F if it can be   obtained by replacing each edge in F by a hyperedge containing it. Given a   family of graphs       , we say that a hypergraph H is Berge       -free if for every FÎ       , H does not contain a Berge F as a subhypergraph. In this   talk, we investigate the connections between spectral radius of the adjacency   tensor and structural properties of a hypergraph. In particular, a spectral   version of Turán-type result on linear k-uniform hypergraphs is obtained by   using spectral methods, including a tight result on Berge       -free linear 3-uniform hypergraphs. This is the joint work   with Y. Hou and J.Cooper.个人简历：常安， 福州大学教授，博士生导师。 1998 年 6 月毕业于四川大学应用数学专业，获博士学位。目前兼任中国数学会组合数学与图论专业委员会副主任（常务理事）、福建省运筹学会理事长。主要从事图论领域中图的谱理论及应用研究。已在国内外专业期刊发表研究论文 60 多篇，参加了包括国家重点研究计划（973 计划）项目课题、国家自然科学基金重点项目在内的十余项国家级科研项目的研究工作，并承担了包括国家自然科学基金面上项目、天元基金专项和其他省级科研项目的研究工作。2004年获福建省科学技术二等奖。 待定 10月12日9:40-10:40 报告题目：Efficient   sparse Hessian based algorithms for the clustered lasso problem报 告 人：刘勇进（福州大学）报告摘要：This   talk focuses on solving the   clustered lasso problem, which is a least squares problem with the L1-type   penalties imposed on both the coefficients and their pairwise differences to   learn the group structure of the regression parameters. Here we first   reformulate the clustered lasso regularizer as a weighted ordered-lasso   regularizer, which is essential in reducing the computational cost from O(n2)   to O(nlog(n)). We then propose an inexact semismooth Newton augmented   Lagrangian (Ssnal) algorithm to solve the clustered lasso problem or its dual   via this equivalent formulation, depending on whether the sample size is   larger than the dimension of the features. An essential component of the Ssnal algorithm is the computation of   the generalized Jacobian of the proximal mapping of the clustered lasso   regularizer. Based on the new formulation, we derive an efficient procedure   for its computation. Comprehensive   results on the global convergence and local linear convergence of the Ssnal   algorithm are established. For the purpose of exposition and comparison, we   also summarize/design several first-order methods that can be used to solve   the problem under consideration, but with the key improvement from the new   formulation of the clustered lasso regularizer. As a demonstration of the   applicability of our algorithms, numerical experiments on the clustered lasso   problem are performed. The experiments show that the Ssnal algorithm   substantially outperforms the best alternative algorithm for the clustered   lasso problem. [This is a joint   work with Meixia Lin, Defeng Sun and Kim-Chuan Toh.]个人简历：刘勇进，博士，福州大学数学与计算机科学学院教授，博士生导师。2004年07月毕业于大连理工大学获运筹学与控制论专业博士学位，曾于2006.07-2010.01在新加坡国立大学从事三年半Research Fellow研究工作。研究兴趣主要包括：最优化理论、方法与应用，大规模数值计算，统计优化等，研究成果在Mathematical Programming, Series A（2篇）、SIAM Journal on Optimization、Computational Optimization and Applications、Journal of Optimization Theory and Applications、Set-Valued and Variational Analysis等国际优化学术期刊上发表。主持国家自然科学基金3项（青年基金1项，面上项目2项），主持其他省部级纵向科研项目5项。现任中国运筹学会青年工作委员会委员，中国运筹学会数学规划分会理事，中国运筹学会智能工业数据解析与优化分会理事。 待定 10月12日10:40-11:00 茶歇 10月12日11:00-12:00 报告题目：Large   book-cycle Ramsey numbers报 告 人：林启忠（福州大学）报告摘要：Let       be the book graph which consists of n copies of       all sharing a common       , and let       be a cycle of length m. We   determine the exact value of       for 9n/10 ≤ m ≤ 10n/9 and n large enough.   This gives an answer to a question by Faudree, Rousseau and Sheehan in a   stronger form when m and n are large. Furthermore, we are able   to determine the asymptotic value of       for each fixed   integer k ≥ 3. Namely, we prove for each k ≥ 3,       The proofs are mainly built upon   results on the (weakly) pancyclic properties of graphs, Lucazk’s result on   graphs without long odd cyles, and a refined version of regularity lemma by   Conlon.个人简历：林启忠，教授，博士生导师。2009年7月毕业于同济大学数学系，获理学博士学位。于2014.08-2015.08在美国加州大学圣地亚哥分校（UCSD）访学一年。2017年入选“福建省高等学校新世纪优秀人才支持计划”。研究内容主要包括图的Ramsey 理论及相关极值图论问题，涉及Szemeredi正则引理、概率方法、代数构造等。目前获国家自然科学基金面上项目资助。 待定 10月12日12:20-13:20 午餐福盛源酒店二楼 10月12日15:00-16:00 报告题目：On Max-Cut   and Max-Bisection of graphs报 告 人：侯建锋（福州大学）报告摘要：Many classical partition problems in Combinatorics and Computer Science   seek a partition of a combinatorial object (e.g., a graph, directed graph,   hy-pergraph, etc.) which optimizes a single parameter. One such problem are   the Max-Cut problem, where one seeks to partition the vertex set       of a graph G   into two disjoint parts       and       so that the number of edges of G crossing between       and       is maximal. In this talk, we will   investigate Max-Cut and Max-Bisection of graphs through combinatorial and   probabilistic arguments. 个人简历：侯建锋，教授，博士生导师，福州大学“旗山学者”，现为数学与计算机科学学院副院长。2009年7月毕业于山东大学数学学院，获理学博士学位。2011年度全国优秀博士学位论文提名奖，2011年度福建省自然科学基金杰出青年项目获得者，主要从事图论及其应用研究，解决了图与超图划分领域的多个猜想和公开问题，发表论文50余篇。美国数学评论“MathematicalReview”评论员。 待定 10月12日16:00-16:20 茶歇 10月12日16:20-17:20 报告题目：Threshold   function of ray nonsingularity for uniformly random ray pattern matrices报 告 人：刘月（福州大学）报告摘要：A complex square matrix is called a ray pattern matrix if all of its   nonzero entries are unimodular, and it is always represented as an   arc-weighted digraph. A ray pattern matrix A is called ray nonsingular if for any entry-wise positive matrix   K, A◦K is nonsingular. A   random model of ray pattern matrices with order n is given, where a uniformly random ray pattern matrix B is defined to be the adjacency matrix of a   simple random digraph       whose arcs are weighted with   i.i.d. random variables uniformly distributed over the unit circle in the   complex plane. It is shown that       is a threshold function for the   random matrix M = I – B to be ray   nonsingular.个人简历：刘月，福州大学教授。2004年6月毕业于同济大学，获理学学士学位。2010年3月毕业于同济大学，获理学博士学位。 待定 17:40-18:40 晚餐福盛源酒店二楼 10月13日9:00-10:00 报告题目：A   Discriminative Projection and Representation-based Classification Framework   for Face Recognition报 告 人：彭拯（湘潭大学）报告摘要：The sparse representation-based classifier (SRC) has been developed and   showed having great potential for real-world face recognition. In this paper,   we propose a novel discriminative projection and representation-based   classification model (DPRC) and algorithm to enhance the discriminant ability   of the SRC. The proposed model first obtains a discriminative projection   which not only maximizing the ratio of the distance within inter-class over   the distance within intra-class, but also minimizing the linear approximation   error within intra-class, then projects the original data onto the   discriminative space and adopts some SRC methods to obtain final solution. In   addition, an optimization method was   adopted using the augmented Lagrangian scheme, and we show that the proposed   optimization method has the sub-sequence convergence property.Experimental   results on the Yale, ORL, CMU PIE and AR face image databases demonstrate   that, the DPRC method is very   effective compared to the existing feature extraction methods based on the   SRC. 个人简历：彭拯，湘潭大学数学与计算机科学学院教授，博士生导师. 主要从事数学优化理论、算法及其应用研究. 2008年毕业于上海大学数学系，获博士学位，2010年由南京大学数学系博士后出站. 当前主持国家自然科学基金面上项目1项，天元数学交流项目1项，发表SCI检索论文20多篇. 待定 10:00-10:20 茶歇 10月13日10:20-11:20 报告题目：协作式输出调节理论及在微电网功率分配中的应用报 告 人：苏友峰（福州大学）报告摘要：In this talk, we present a distributed observer control framework for the   cooperative output regulation problem of leader-follower multi-agent systems.   With the aid of certainty equivalence principle, it is shown that the   cooperative output regulation problem can be solved by a distributed   controller composed of a distributed observer of the leader system and a   centralized controller of the follower systems. As an application, we further   show that the power sharing control problem of a grid-connected AC microgrid   can be reformulated and hence solved as the cooperative output regulation   problem of an interconnected leader-follower multi-agent system. It is   interesting to see that the proposed design is able to handle microgrids   where the system parameters of the dispatchable distributed generators are   subject to arbitrarily large uncertainties. 个人简历：苏友峰，1982年出生，博士，教授，博士生导师。2005年与2008年分别获华东师范大学数学系学士与硕士学位。2012年获香港中文大学机械与自动化工程学系博士学位。2012年5月至2013年6月于香港中文大学机械与自动化工程学系从事博士后研究工作。2013年6月起任职于福州大学数学与计算机科学学院。研究方向包括：输出调节、非线性控制、多自主体系统协同控制、鲁棒与自适应控制、切换/混杂系统稳定性分析。苏友峰博士已在国内外重要学术期刊与会议上已发表（含录用）论文五十余篇，其中发表在系统控制领域两大国际公认权威期刊IEEE Transactions on Automatic Control与Automatica上共有十六篇。苏友峰博士于2015年入选国家第十一批“千人计划”青年人才，同年入选第四批福建省引进高层次创业创新人才；2016年获福建省自然科学基金杰出青年项目资助；2018年入选福建省高校领军青年拔尖人才。苏友峰博士于2013年获香港中文大学青年学者优秀博士论文奖（Young Scholars Thesis Award）。苏友峰博士目前担任国际期刊《International Journal of Robust and Nonlinear   Control》 编委、国内核心期刊《系统科学与数学》编委、IEEE控制系统学会Conference Editorial Board编委；担任中国自动化学会控制理论专业委员会（TCCT）委员，中国自动化学会控制理论专业委员会非线性系统与控制学组共同主任。 待定 11:40-12:40 午餐福盛源酒店二楼 10月13日14:30-17:00 专家、学生自由交流、咨询