Augmented Lagrangian (AL) methods have proven remarkably useful in solving optimization problems with complicated constraints. The last decade has seen the development of overall complexity guarantees for inexact AL variants. Yet, a crucial gap persists in addressing nonsmooth convex constraints. To this end, we present a smoothed augmented Lagrangian (AL) framework where nonsmooth terms are progressively smoothed with a smoothing parameter \(\eta _k\) . The resulting AL subproblems are \(\eta _k\) -smooth, allowing for leveraging accelerated schemes. By a careful selection of the inexactness level \(\epsilon _k\) (for inexact subproblem resolution), the penalty parameter \(\rho _k\) , and smoothing parameter \(\eta _k\) at epoch k, we derive rate and complexity guarantees of \(\tilde{\mathcal {O}}(1/\varvec{\varepsilon }^{3/2})\) and \(\tilde{\mathcal {O}}(1/\varvec{\varepsilon })\) in convex and strongly convex regimes for computing an \(\varvec{\varepsilon }\) -optimal solution, when \(\rho _k\) increases at a geometric rate, a significant improvement over the best available guarantees for AL schemes for convex programs with nonsmooth constraints. Analogous guarantees are developed for settings with \(\rho _k = \rho \) as well as \(\eta _k = \eta \) . Preliminary numerics on a fused Lasso problem display promise.
