论文信息 - Using a factored dual in augmented Lagrangian methods for semidefinite programming

Using a factored dual in augmented Lagrangian methods for semidefinite programming

Abstract In the context of augmented Lagrangian approaches for solving semidefinite programming problems, we investigate the possibility of eliminating the positive semidefinite constraint on the dual matrix by employing a factorization. Hints on how to deal with the resulting unconstrained maximization of the augmented Lagrangian are given. We further use the approximate maximum of the augmented Lagrangian with the aim of improving the convergence rate of alternating direction augmented Lagrangian frameworks. Numerical results are reported, showing the benefits of the approach.

[1] Wotao Yin,et al. Alternating direction augmented Lagrangian methods for semidefinite programming , 2010, Math. Program. Comput..

[2] Bingsheng He,et al. The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent , 2014, Mathematical Programming.

[3] Franz Rendl,et al. A Boundary Point Method to Solve Semidefinite Programs , 2006, Computing.

[4] Renato D. C. Monteiro,et al. Digital Object Identifier (DOI) 10.1007/s10107-004-0564-1 , 2004 .

[5] Franz Rendl,et al. Semidefinite relaxations of ordering problems , 2013, Math. Program..

[6] Franz Rendl,et al. Regularization Methods for Semidefinite Programming , 2009, SIAM J. Optim..

[7] Dimitri P. Bertsekas,et al. Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[8] Kim-Chuan Toh,et al. Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems , 2003, SIAM J. Optim..

[9] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .

[10] Renato D. C. Monteiro,et al. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..