Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates
Radu Ioan Bot, Ern\"o Robert Csetnek, Dang-Khoa Nguyen

TL;DR
This paper introduces a fast inertial Augmented Lagrangian method for convex optimization with linear constraints, providing convergence guarantees for both the objective and the iterates without requiring strong convexity.
Contribution
It develops a new inertial algorithm based on discretizing a second-order primal-dual dynamical system, achieving convergence rates and iterates convergence in the convex setting.
Findings
Achieves O(1/k^2) convergence rate for primal-dual gap, feasibility, and objective value.
Proves convergence of primal-dual iterates to a solution without strong convexity assumptions.
Compatible with continuous-time convergence results from prior work.
Abstract
This work aims to minimize a continuously differentiable convex function with Lipschitz continuous gradient under linear equality constraints. The proposed inertial algorithm results from the discretization of the second-order primal-dual dynamical system with asymptotically vanishing damping term addressed by Bot and Nguyen in [Bot, Nguyen, JDE, 2021], and it is formulated in terms of the Augmented Lagrangian associated with the minimization problem. The general setting we consider for the inertial parameters covers the three classical rules by Nesterov, Chambolle-Dossal and Attouch-Cabot used in the literature to formulate fast gradient methods. For these rules, we obtain in the convex regime convergence rates of order for the primal-dual gap, the feasibility measure, and the objective function value. In addition, we prove that the generated sequence of primal-dual…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Advanced Optimization Algorithms Research · Sparse and Compressive Sensing Techniques
