We present an alternating direction method based on an augmented Lagrangian framework for solving semidefinite programming (SDP) problems in standard form. At each iteration, the algorithm, also known as a two-splitting scheme, minimizes the dual augmented Lagrangian function sequentially with respect to the Lagrange multipliers corresponding to the linear constraints, then the dual slack variables and finally the primal variables, while in each minimization keeping the other variables fixed. Convergence is proved by using a fixed-point argument. A multiple-splitting algorithm is then proposed to handle SDPs with inequality constraints and positivity constraints directly without transforming them to the equality constraints in standard form. Finally, numerical results for frequency assignment, maximum stable set and binary integer quadratic programming problems are presented to demonstrate the robustness and efficiency of our algorithm.
Citation
@TECHREPORT{AltSDP-WenGoldfarbYin-2009, author = {Wen, Zaiwen and Goldfarb, Donald and Yin, Wotao}, title = {Alternating Direction Augmented Lagrangian Methods for semidefinite programming}, institution = {Dept of IEOR, Columbia University}, year = {2009} }
Article
View Alternating Direction Augmented Lagrangian Methods for semidefinite programming