Three inexact augmented Lagrangian methods achieve optimal O(1/epsilon) primal-dual complexity for verifiable KKT points in convex linearly constrained optimization, two of them parameter-free.
SIAM Journal on Optimization , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal Nonergodic Primal-Dual Complexity of Efficient Inexact Parameter-Free Augmented Lagrangian Methods
Three inexact augmented Lagrangian methods achieve optimal O(1/epsilon) primal-dual complexity for verifiable KKT points in convex linearly constrained optimization, two of them parameter-free.