Using a Factored Dual in Augmented Lagrangian Methods for Semidefinite Programming
arXiv:1710.04869 · doi:10.1016/j.orl.2018.08.003
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.
7 pages
Cited by in corpus (5)
- SDP-based bounds for graph partition via extended ADMM
- A Computational Study of Exact Subgraph Based SDP Bounds for Max-Cut, Stable Set and Coloring
- An SDP-Based Approach for Computing the Stability Number of a Graph
- Improving ADMMs for Solving Doubly Nonnegative Programs through Dual Factorization
- Using L1-relaxation and integer programming to obtain dual bounds for sparse PCA