A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming |
| |
Authors: | Chengjing Wang Peipei Tang |
| |
Institution: | 1.School of Mathematics,Southwest Jiaotong University,Chengdu,China;2.School of Computing Science,Zhejiang University City College,Hangzhou,China |
| |
Abstract: | In this paper, we propose a primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming problems, especially for some difficult problems. The basic idea of this method is to apply the majorized semismooth Newton-CG augmented Lagrangian method to the primal convex problem. And we take two special nonlinear semidefinite programming problems as examples to illustrate the algorithm. Furthermore, we establish the global convergence and the iteration complexity of the algorithm. Numerical experiments demonstrate that our method works very well for the testing problems, especially for many ill-conditioned ones. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|