运筹学

非线性半定规划的逐次线性化柔性惩罚法

展开
  • 1.  苏州大学数学科学学院, 江苏苏州 215006

收稿日期: 2017-04-07

  网络出版日期: 2017-06-15

基金资助

国家自然科学基金(No. 11371273)

A successive linearization method with flexible penalty for nonlinear semidefinite programming

Expand
  • 1. School of Mathematical Science, Soochow University, Suzhou 215006, Jiangsu, China

Received date: 2017-04-07

  Online published: 2017-06-15

摘要

针对非线性不等式约束半定规划问题提出一种新的逐次线性化方法, 新算法既不要求罚函数单调下降, 也不使用过滤技巧, 尝试步的接受准则仅仅依赖于目标函数和约束违反度, 罚函数中对应于成功迭代点的罚因子不需要单调增加. 新算法或者要求违反约束度量有足够改善, 或者在约束违反度的一个合理范围内要求目标函数值充分下降, 在通常假设条件下, 分析了新算法的适定性及全局收敛性. 最后, 给出了非线性半定规划问题的数值试验结果, 结果表明了新算法的有效性.

本文引用格式

陈中文, 赵奇, 卞凯 . 非线性半定规划的逐次线性化柔性惩罚法[J]. 运筹学学报, 2017 , 21(2) : 84 -100 . DOI: 10.15960/j.cnki.issn.1007-6093.2017.02.010

Abstract

A successive linearization method with flexible penalty is presented to solve a nonlinear semidefinite programming with nonlinear inequality constraints. The new method does not require the penalty function to be reduced and does not use filter technique. The storage of the filter set is avoided. The updating of the penalty parameter is flexible, which is only dependent on the message of the current iterate. The penalty parameter sequence corresponding to the successful iterate point does not need to increase monotonically. To decide whether the trial step can be accepted or not, the new method requires the measure of constraint violation to be improved or the value of the objective function to be improved within the measure of feasibility control. Under the usual assumptions, we prove that the algorithm is well defined and globally convergent. Finally, preliminary numerical results are reported.

参考文献

[1] Todd M J. Semidefinite optimization [J]. Acta Numerica, 2001, 10: 515-560.
[2] Kanzow C, Nagel C, Kato H. Successive linearization methods for nonlinear semidefinite programs [J]. Computational Optimization and Applications, 2005, 31: 251-273.
[3] Li C J, Sun W Y. On filter-successive linearization methods for nonlinear semidefinite programming [J]. Science in China, 2009, 52: 2341-2361.
[4] Sun J, Sun D F, Qi L Q. A squared smoothing Newton method for nonsmooth matrix equations and its applications in semidefinite optimization problems [J]. Siam Journal on Optimization, 2004, 14: 783-806.
[5] Nie J W, Yuan Y X. A potential reduction algorithm for an extended SDP problem [J]. Science in China, 2000, 43: 35-46.
[6] Jarre F. An interior method for nonconvex semidefinite programs [J]. Optimization and Engineering, 2000, 1: 347-372.
[7] Fares B, Noll D, Apkarian P. Robust control via sequential semidefinite programming [J]. SIAM J Contr Optim, 2002, 40: 1791-1820.
[8] Walter G, Hector R. A filter algorithm for nonlinear semidefinite programming [J]. Comput Appl Math, 2010, 29: 297-328.
[9] Sun D F, Sun J, Zhang L.  The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming [J]. Math Prog, 2008, 114: 349-391.
[10] Fletcher R, Leyffer S. Nonlinear programming without a penalty function [J]. Math Prog, 2002, 91: 239-269.
[11] Toh K C, Tutuncu R H, Todd M J. SDPT3 version 4.0---a MATLAB software for semidefinite-quadratic-linear programming [J]. Optimization Methods and Software, 1999, 11: 545-581.
[12] Borchers B. SDPLIB 1.2, a library of semidefinite programming test problems [J]. Optim Meth Softw, 1999, 11: 597-611.
文章导航

/