An accelerated augmented Lagrangian method for linearly constrained convex programming with the rate of convergence \(O\left({1/{k^2}} \right)\)

DOI10.1007/s11766-017-3381-zzbMath1389.90256OpenAlexW2593225479MaRDI QIDQ2408886

Yi-Fen Ke, Chang-Feng Ma

Publication date: 20 October 2017

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-017-3381-z

zbMATH Keywords

convex programmingaugmented Lagrangian methodlinearly constrainedaccelerated technique

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (2)

An accelerated proximal augmented Lagrangian method and its application in compressive sensing ⋮ Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems

Cites Work

• Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
• Augmented Lagrangian method for total variation restoration with non-quadratic fidelity
• The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
• Accelerated linearized Bregman method
• Multiplier and gradient methods
• The Augmented Lagrangian Method for Parameter Estimation in Elliptic Systems
• An Augmented Lagrangian Method for Identifying Discontinuous Parameters in Elliptic Systems
• Numerical Optimization
• An augmented Lagrangian method for discrete large‐slip contact problems
• An Augmented Lagrangian Method for Total Variation Video Restoration

This page was built for publication: An accelerated augmented Lagrangian method for linearly constrained convex programming with the rate of convergence \(O\left({1/{k^2}} \right)\)