A new partial splitting augmented Lagrangian method for minimizing the sum of three convex functions

摘要

In this paper, we propose a new partial splitting augmented Lagrangian method for solving the separable constrained convex programming problem where the objective function is the sum of three separable convex functions and the constraint set is also separable into three parts. The proposed algorithm combines the alternating direction method (ADM) and parallel splitting augmented Lagrangian method (PSALM), where two operators are handled by a parallel method, while the third operator and the former two are dealt with by an alternating manner. Under mild conditions, we prove the global convergence of the new method. We also report some preliminary numerical results on constrained matrix optimization problem, illustrating the advantage of the new algorithm over the most recently PADALM of Peng and Wu (2010) [12].