First-Order Methods for Constrained Convex Programming Based on Linearized Augmented Lagrangian Function
Published Online:26 Jan 2021https://doi.org/10.1287/ijoo.2019.0033
- Cited by
- Lower Complexity Bounds of First-Order Methods for Affinely Constrained Composite Nonconvex Problems12 June 2025 | Mathematics of Operations Research, Vol. 51, No. 2
- 12 March 2026 | Computational Optimization and Applications, Vol. 94, No. 1
- 6 January 2026 | Mathematical Programming Computation, Vol. 21
- 23 January 2025 | Mathematics of Operations Research, Vol. 51, No. 1
- 20 November 2024 | Mathematics of Computation, Vol. 94, No. 356
- 3 October 2025 | Mathematics of Operations Research, Vol. 0, No. 0
- 22 September 2025 | Mathematical Programming, Vol. 32
- 20 August 2025 | Machine Learning, Vol. 114, No. 9
- 10 April 2024 | Mathematics of Computation, Vol. 94, No. 351
- 7 September 2023 | Computational Optimization and Applications, Vol. 87, No. 1
- 23 June 2023 | SIAM Journal on Optimization, Vol. 33, No. 2
- 19 January 2023 | SIAM Journal on Optimization, Vol. 33, No. 1
- 19 October 2022 | SIAM Journal on Optimization, Vol. 32, No. 4
- 24 June 2022 | Computational Optimization and Applications, Vol. 83, No. 1
- 1 August 2022 | SIAM Journal on Optimization, Vol. 32, No. 3
- 3 February 2022 | Mathematical Programming Computation, Vol. 14, No. 2
- 25 January 2021 | Advances in Computational Mathematics, Vol. 47, No. 1
Volume 3, Issue 1
January 2021
Pages 1-117
Article Information
Metrics
Information
- Received:July 08, 2019
- Accepted:January 29, 2020
- Published Online:January 26, 2021
Copyright © 2021, INFORMS
Cite as
Yangyang Xu (2021) First-Order Methods for Constrained Convex Programming Based on Linearized Augmented Lagrangian Function. INFORMS Journal on Optimization 3(1):89-117.
https://doi.org/10.1287/ijoo.2019.0033
Keywords
