Iteration complexity of a proximal augmented lagrangian method for solving nonconvex composite optimization problems with nonlinear convex constraints
| Year of publication: |
2023
|
|---|---|
| Authors: | Kong, Weiwei ; Melo, Jefferson G. ; Monteiro, Renato D. C. |
| Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 48.2023, 2, p. 1066-1094
|
| Subject: | accelerated first-order methods | inexact proximal augmented Lagrangian method | iteration complexity | K-convexity | nonlinear constrained smooth nonconvex composite programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Nichtlineare Regression | Nonlinear regression | Nichtlineare Optimierung | Nonlinear programming |
-
A survey of nonlinear robust optimization
Leyffer, Sven, (2020)
-
Optimization techniques for tree-structured nonlinear problems
Hübner, Jens, (2020)
-
Ngueveu, Sandra Ulrich, (2019)
- More ...
-
Yan, Zhishan, (2025)
-
Liang, Jiaming, (2024)
-
A primal dual modified subgradient algorithm with sharp Lagrangian
Burachik, Regina S., (2010)
- More ...