非线性半定规划一个新的全局收敛算法
A New Globally Convergent Algorithm for Nonlinear Semidefinite Programming
DOI: 10.12677/AAM.2018.74056, PDF,    国家自然科学基金支持
作者: 张 辉, 黎健玲*:广西大学数学与信息科学学院,广西 南宁
关键词: 非线性半定规划SSDP算法KKT点全局收敛性Nonlinear Semidefinite Programming SSDP Algorithm KKT Point Global Convergence
摘要: 本文提出了一个求解非线性半定规划的序列二次半定规划(SSDP)算法。算法每次迭代通过求解两个半定规划子问题确定搜索方向;通过引进距离函数来构造效益函数用于线搜索,从而产生新的迭代点。在适当的假设条件下,算法或收敛到问题的不可行稳定点,或收敛到问题的KKT点。
Abstract: In this paper, we present a sequence quadratic semidefinite programming (SSDP) algorithm for nonlinear semidefinite programming. At each iteration, the search direction is determined by solving two semidefinite programming sub problems; by introducing a distance function, a merit function is constructed for line search. Under some appropriate conditions, any accumulation point of iterative point sequence is either an infeasible stationary point, or a KKT point of the problem.
文章引用:张辉, 黎健玲. 非线性半定规划一个新的全局收敛算法[J]. 应用数学进展, 2018, 7(4): 456-465. https://doi.org/10.12677/AAM.2018.74056

参考文献

[1] Ben-Tal, A., Jarre, F., Kocvara, M., Nemirovski, A. and Zowe, J. (2000) Optimal Design of Trusses under a Nonconvex Global Buckling Constraint. Optimization and Engineering, 1, 189-213. [Google Scholar] [CrossRef
[2] Fares, B., Noll, D. and Apkarian, P. (2002) Robust Control via Sequential Semidefinite Programming. SIAM Journal on Control and Optimization, 40, 1791-1820. [Google Scholar] [CrossRef
[3] Kocvara, M. and Stingl, M. (2004) Solving Nonconvex SDP Problems of Structural Optimization with Stability Control. Optimization Methods and Software, 19, 595-609. [Google Scholar] [CrossRef
[4] Jarre, F. (2000) An Interior Method for Nonconvex Semidefinite Programs. Optimization and Engineering, 1, 347-372. [Google Scholar] [CrossRef
[5] Fares, B., Apkarian, P. and Noll, D. (2001) An Augmented Lagrangian Method for a Class of LMI-Constrained Problems in Robust Control Theory. International Journal of Control, 74, 3702-3706. [Google Scholar] [CrossRef
[6] Nishimura, R., Hayashi, S. and Fukushima, M. (2012) Semidefinite Complement Arit Reformulation for Robust Nash Equilibrium Problems with Euclidean Uncertainty Sets. Journal of Global Optimization, 53, 107-120.
[7] Correa, R. and Ramirez, H. (2004) A Global Algorithm for Nonlinear Semidefinite Programming. SIAM Journal on Optimization, 15, 303-318. [Google Scholar] [CrossRef
[8] Burke, J.V. and More, J.J. (1988) On the Identification of Active Constraints. SIAM Journal on Numerical Analysis, 25, 1197-1211. [Google Scholar] [CrossRef
[9] Dunn, J.C. (1987) On the Convergence of Projected Gradient Processes to Singular Critical Points. Journal of Optimization Theory and Applications, 55, 203-216. [Google Scholar] [CrossRef
[10] Burke, J.V. and Han, S.P. (1989) A Robust Sequential Quadratic Programming Method. Mathematical Programming, 43, 277-303. [Google Scholar] [CrossRef