学 术 报 告

报告人: 李冲教授 浙江大学

题目: Linearized proximal algorithms with adaptive stepsizes

for convex composite optimization with applications

主持人：贵州大学数学与统计学院院长 王锦荣 教授

时间：2019年12月23日 星期一 15:30-16:30

地点：博学楼416会议室

摘要: In this talk, we continue to study the problem of numerically solving convexcomposite optimizations. Linearized proximal algorithms (LPA) with adaptive stepsizes forsolving the convex composite optimization problem are proposed. Local and/or global convergenceproperties of the proposed algorithms are explored, and their superlinear/quadraticconvergence results are established under the assumptions of local weak sharp minima andthe quasi-regularity condition. Our proposed algorithms, compared with the LPA with theconstant stepsize, have the advantages of suiting for wider range of problems and of employinghigher convergence rates. We apply the LPA with adaptive stepsizes to solve thewirelesssensor network localization problem, and the numerical results show that the LPAwithadaptive stepsizes can solve this problem more e_ciently and stable than the LPA withthe constant stepsize or other algorithms.

 报告人简介：

李冲老师现任浙江大学数学系教授，博士生导师。1995年获浙江大学博士学位，现任Pure and Applied Functional Analysis杂志、Linear and Nonlinear Analysis杂志、《高等学校计算数学学报》杂志编委。主要从事Banach空间理论、非光滑分析、非线性逼近与优化、数值泛函分析等领域的研究。先后主持中国国家自然科学基金、西班牙及南非国家自然科学基金等二十余项，出版专著1部，在SCI期刊上发表论文100余篇， 特别是在优化理论的顶级刊物SIAM J Optim.，SIAM J. Control Optim.和Math. Program等权威期刊上发表论文逾20篇。 曾获浙江省教委科技进步奖一、二等奖等奖励，先后被评为享受国务院政府特殊津贴专家、原商业部有突出贡献的中青年专家、江苏省青蓝工程优秀骨干教师。江苏省第七届青年科学家、教育部优秀骨干教师等，2004年获教育部首届新世纪优秀人才计划资助。