Convergence of ADMM for Three-Block Separable Quadratic Programming Problems with Linear Constraints

Abstract

The alternating direction method of multipliers is applied to three-block separable quadratic programming problems whose objective function is the sum of three functions without coupled variables. Necessary and sufficient conditions for the unique solvability of this problem are established. The convergence of the method is considered from the viewpoints of matrix computation and numerical optimisation.