The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming |
| |
Authors: | Defeng Sun Jie Sun Liwei Zhang |
| |
Affiliation: | (1) Department of Mathematics, National University of Singapore, Singapore, Singapore;(2) Department of Decision Sciences, National University of Singapore, Singapore, Singapore;(3) Department of Applied Mathematics, Dalian University of Technology, Dalian, 116024, China |
| |
Abstract: | We analyze the rate of local convergence of the augmented Lagrangian method in nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and variational analysis on the projection operator in the symmetric matrix space. Without requiring strict complementarity, we prove that, under the constraint nondegeneracy condition and the strong second order sufficient condition, the rate of convergence is linear and the ratio constant is proportional to 1/c, where c is the penalty parameter that exceeds a threshold . The research of Defeng Sun is partly supported by the Academic Research Fund from the National University of Singapore. The research of Jie Sun and Liwei Zhang is partly supported by Singapore–MIT Alliance and by Grants RP314000-042/057-112 of the National University of Singapore. The research of Liwei Zhang is also supported by the National Natural Science Foundation of China under project grant no. 10471015 and by the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry, China. |
| |
Keywords: | Nonlinear semidefinite programming Rate of convergence The augmented Lagrangian method Variational analysis |
本文献已被 SpringerLink 等数据库收录! |
|