题  目：A Class of Smoothing-Regularization Methods to Mathematical Programs with Vanishing Constraints

报告人：胡清洁 教授

单  位：桂林电子科技大学

时  间：6月3日 17:00

地  点：河南大学龙子湖校区九章学堂C座302

摘要：In this paper, based on the smoothing technique in [X. J. Chen, Mathematical Programming, 134(1): 71-99, 2012.], we propose a class of smoothing regularization methods for solving the mathematical programming with vanishing constraints. These methods include the smoothing regularization method proposed by Kanzow et al in [Computational Optimization and Applications, 55(3): 733-767, 2013.] as a special case. Under the weaker conditions than the ones that have been used by Kanzow et al in 2013, we prove that the MFCQ holds at the feasible points of the smoothing-regularization problem. We also analyze that the convergence behavior of the proposed smoothing-regularization method under mild conditions, i.e., an accumulation point of the stationary points sequence for the smoothing-regularization problem is a strong stationary point. Finally, numerical experiments are given to show the efficiency of the proposed methods.

报告人简介：胡清洁教授，博士，桂林电子科技大学运筹学与控制论方向硕士生导师，曾入选湖南省新世纪121人才工程和湖南省高校青年骨干教师，研究方向为最优化理论与方法，主持在研和完成国家自然科学基金课题各1项，主持完成广西区自然科学基金课题1项, 参与在研和完成国家自然科学基金课题3项, 主持完成湖南省教育厅科研课题1项，先后在Applied Mathematics and Optimization、Annals of Operations Research、Optimization Letters、Optimization等杂志上发表论文40多篇，其中SCI收录论文20余篇。