An accelerated augmented Lagrangian method for linearly constrained convex programming with the rate of convergence O(1/k 2)
In this paper, we propose and analyze an accelerated augmented Lagrangian method (denoted by AALM) for solving the linearly constrained convex programming. We show that the convergence rate of AALM is O(1/k 2) while the convergence rate of the classical augmented Lagrangian method (ALM) is O(1/k). Numerical experiments on the linearly constrained l 1−l 2 minimization problem are presented to demonstrate the effectiveness of AALM.
Keywordsaugmented Lagrangian method linearly constrained convex programming accelerated technique
Unable to display preview. Download preview PDF.
The authors would like to express their great thankfulness to the referees for the comments and constructive suggestions, which are valuable in improving the quality of this manuscript.
- B-S He, X-M Yuan. On the acceleration of augmented Lagrangian method for linearly constrained optimization, 2010, http://www.optimization-online.org/DB FILE/2010/10/2760.pdfGoogle Scholar
- Z-C Lin, M-M Chen, Y Ma. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices, 2010, arXiv:1009.5055.Google Scholar
- Y E Nesterov. A method for unconstrained convex minimization problem with the rate of convergence O(1/k2), Dokl AN SSSR, 1983, 269(3): 543–547.Google Scholar
- M J D Powell. A method for nonlinear constraints in minimization problems, In: Optimization, Academic Press, New York, 1969, 283–298.Google Scholar