Journal article · 2025 · Open access

A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints

Peixuan Zhang, Uday V. Shanbhag, Ethan X. Fang

Journal of Scientific Computing, 104(2) · Published 21 June 2025 · DOI 10.1007/s10915-025-02934-w

Open PDFView at the publisherCite this paper

In brief

“A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints” is a 2025 journal article by Peixuan Zhang and 2 co-authors, published in Journal of Scientific Computing. OpenAlex counts 1 citations as of 18 November 2026. It is open access under a CC BY licence: the full text is free to read at Journal of Scientific Computing.

Citations
1
Most cited in
2025 (1)
Field-weighted impact
0.43
References
45
Authors
3

Abstract

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$$ η k . The resulting AL subproblems are $$\eta _k$$ η k -smooth, allowing for leveraging accelerated schemes. By a careful selection of the inexactness level $$\epsilon _k$$ ϵ k (for inexact subproblem resolution), the penalty parameter $$\rho _k$$ ρ k , and smoothing parameter $$\eta _k$$ η k at epoch k, we derive rate and complexity guarantees of $$\tilde{\mathcal {O}}(1/\varvec{\varepsilon }^{3/2})$$ O ~ ( 1 / ε 3 / 2 ) and $$\tilde{\mathcal {O}}(1/\varvec{\varepsilon })$$ O ~ ( 1 / ε ) in convex and strongly convex regimes for computing an $$\varvec{\varepsilon }$$ ε -optimal solution, when $$\rho _k$$ ρ 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 $$ ρ k = ρ as well as $$\eta _k = \eta $$ η k = η . Preliminary numerics on a fused Lasso problem display promise.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Zhang, P., Shanbhag, U. V., & Fang, E. X. (2025). A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints. Journal of Scientific Computing, 104(2). https://doi.org/10.1007/s10915-025-02934-w

MLA 9

Zhang, Peixuan, et al. “A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints.” Journal of Scientific Computing, vol. 104, no. 2, 2025. https://doi.org/10.1007/s10915-025-02934-w.

Chicago

Zhang, Peixuan, Uday V. Shanbhag, and Ethan X. Fang. 2025. “A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints.” Journal of Scientific Computing 104 (2). https://doi.org/10.1007/s10915-025-02934-w.

Harvard

Zhang, P., Shanbhag, U. V. and Fang, E. X. (2025) ‘A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints’, Journal of Scientific Computing, 104(2). doi:10.1007/s10915-025-02934-w.

IEEE

P. Zhang, U. V. Shanbhag, and E. X. Fang, “A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints,” Journal of Scientific Computing, vol. 104, no. 2, 2025, doi: 10.1007/s10915-025-02934-w.

BibTeX

@article{zhang2025smoothed,
  title     = {{A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints}},
  author    = {Zhang, Peixuan and Shanbhag, Uday V. and Fang, Ethan X.},
  journal   = {Journal of Scientific Computing},
  year      = {2025},
  volume    = {104},
  number    = {2},
  doi       = {10.1007/s10915-025-02934-w},
  url       = {https://doi.org/10.1007/s10915-025-02934-w}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis

  • augmented Lagrangian method
  • accelerated optimization
  • strongly convex optimization
  • penalty parameter selection
  • fused lasso

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Zhang, P., Shanbhag, U. V., & Fang, E. X. (2025). A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints. Journal of Scientific Computing, 104(2). https://doi.org/10.1007/s10915-025-02934-w

How many times has this paper been cited?

1 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Journal of Scientific Computing: sign in and open the PDF from this page.

Who wrote this paper?

Peixuan Zhang, Uday V. Shanbhag, Ethan X. Fang.

What is the DOI of this paper?

10.1007/s10915-025-02934-w, permanently at https://doi.org/10.1007/s10915-025-02934-w. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.