Improving ADMMs for solving doubly nonnegative programs through dual factorization
Open Access
- 10 September 2020
- journal article
- research article
- Published by Springer Nature in 4OR
- Vol. 19 (3) , 415-448
Abstract
Alternating direction methods of multipliers (ADMMs) are popular approaches to handle large scale semidefinite programs that gained attention during the past decade. In this paper, we focus on solving doubly nonnegative programs (DNN), which are semidefinite programs where the elements of the matrix variable are constrained to be nonnegative. Starting from two algorithms already proposed in the literature on conic programming, we introduce two new ADMMs by employing a factorization of the dual variable. It is well known that first order methods are not suitable to compute high precision optimal solutions, however an optimal solution of moderate precision often suffices to get high quality lower bounds on the primal optimal objective function value. We present methods to obtain such bounds by either perturbing the dual objective function value or by constructing a dual feasible solution from a dual approximate optimal solution. Both procedures can be used as a post-processing phase in our ADMMs. Numerical results for DNNs that are relaxations of the stable set problem are presented. They show the impact of using the factorization of the dual variable in order to improve the progress towards the optimal solution within an iteration of the ADMM. This decreases the number of iterations as well as the CPU time to solve the DNN to a given precision. The experiments also demonstrate that within a computationally cheap post-processing, we can compute bounds that are close to the optimal value even if the DNN was solved to moderate precision only. This makes ADMMs applicable also within a branch-and-bound algorithm.Keywords
All Related Versions
Funding Information
- H2020 Marie Sklodowska-Curie Actions (MINOA 764759)
This publication has 15 references indexed in Scilit:
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type ConstraintsSIAM Journal on Optimization, 2015
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergentMathematical Programming, 2014
- Matrix Relaxations in Combinatorial Optimization2011
- Alternating direction augmented Lagrangian methods for semidefinite programmingMathematical Programming Computation, 2010
- Regularization Methods for Semidefinite ProgrammingSIAM Journal on Optimization, 2009
- Rigorous Error Bounds for the Optimal Value in Semidefinite ProgrammingSIAM Journal on Numerical Analysis, 2008
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- Cliques, Coloring, and Satisfiability1996
- A comparison of the Delsarte and Lovász boundsIEEE Transactions on Information Theory, 1979
- Reducibility among Combinatorial Problems1972