The direct extension of the classic alternating direction method with multipliers (ADMMe) to the multi-block separable convex optimization problem is not necessarily convergent, though it often performs very well in practice. In order to preserve the numerical advantages of ADMMe and obtain convergence, many modified ADMM were proposed by correcting the output of ADMMe or employing proximal terms to solve inexactly the subproblems in ADMMe. In this paper, we present an efficient Prediction-Correction-based ADMM (PCB-ADMM) to solve the multi-block separable convex minimization model. The prediction step takes a special block coordinate descent (BCD) cycle to update the variable blocks, then the correction step corrects the output slightly by computing a convex combination of two points from the prediction step and previous iteration. The convergence property is obtained by using the variational inequality. The numerical experiments illustrate effectiveness of the proposed PCB-ADMM to solve the quadratic semidefinite programming and image decomposition.
Citation
Xiaokai Chang,Sanyang Liu, Pengjun Zhao and Xu Li, Convergent Prediction-Correction-based ADMM for multi-block separable convex programming