A Generalized Alternating Direction Method of Multipliers with Semi-Proximal Terms for Convex Composite Conic Programming

Abstract

In this paper, we propose a generalized alternating direction method of multipliers (ADMM) with semi-proximal terms for solving a class of convex composite conic optimization problems, of which some are high-dimensional, to moderate accuracy. Our primary motivation is that this method, together with properly chosen semi-proximal terms, such as those generated by the recent advance of symmetric Gauss-Seidel technique, is applicable to tackling these problems. Moreover, the proposed method, which relaxes both the primal and the dual variables in a natural way with one relaxation factor in the interval $(0,2)$, has the potential of enhancing the performance of the classic ADMM. Extensive numerical experiments on various doubly non-negative semidefinite programming problems, with or without inequality constraints, are conducted. The corresponding results showed that all these multi-block problems can be successively solved, and the advantage of using the relaxation step is apparent.

30 pages

References in corpus (5)

• A Block Successive Upper Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
• A Convergent 3-Block Semi-Proximal Alternating Direction Method of Multipliers for Conic Programming with $4$-Type of Constraints
• On the convergence properties of a majorized ADMM for linearly constrained convex optimization problems with coupled objective functions
• QSDPNAL: A two-phase augmented Lagrangian method for convex quadratic semidefinite programming
• A Schur Complement Based Semi-Proximal ADMM for Convex Quadratic Conic Programming and Extensions