Accelerated augmented Lagrangian schemes for convex linearly constrained problems achieve o(1/k^2) rates on feasibility violation and objective residual plus iterate convergence under critical parameters.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
Accelerated augmented Lagrangian schemes for convex linearly constrained problems achieve o(1/k^2) rates on feasibility violation and objective residual plus iterate convergence under critical parameters.