GMRES-Accelerated ADMM for Quadratic Objectives
For practitioners solving large-scale conic optimization problems, this provides a practical acceleration of ADMM with theoretical justification and empirical validation.
The paper accelerates ADMM for strongly convex quadratic equality-constrained problems using GMRES, reducing iteration count from O(√κ) to O(κ^{1/4}) in practice, and embeds the method in SeDuMi to achieve O(1/k²) error decay for semidefinite programs.
We consider the sequence acceleration problem for the alternating direction method-of-multipliers (ADMM) applied to a class of equality-constrained problems with strongly convex quadratic objectives, which frequently arise as the Newton subproblem of interior-point methods. Within this context, the ADMM update equations are linear, the iterates are confined within a Krylov subspace, and the General Minimum RESidual (GMRES) algorithm is optimal in its ability to accelerate convergence. The basic ADMM method solves a $κ$-conditioned problem in $O(\sqrtκ)$ iterations. We give theoretical justification and numerical evidence that the GMRES-accelerated variant consistently solves the same problem in $O(κ^{1/4})$ iterations for an order-of-magnitude reduction in iterations, despite a worst-case bound of $O(\sqrtκ)$ iterations. The method is shown to be competitive against standard preconditioned Krylov subspace methods for saddle-point problems. The method is embedded within SeDuMi, a popular open-source solver for conic optimization written in MATLAB, and used to solve many large-scale semidefinite programs with error that decreases like $O(1/k^{2})$, instead of $O(1/k)$, where $k$ is the iteration index.