On the complexity of an augmented Lagrangian method for nonconvex optimization
From MaRDI portal
Recommendations
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
- An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
Cited in
(27)- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- On the cost of solving augmented Lagrangian subproblems
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- scientific article; zbMATH DE number 5077058 (Why is no real title available?)
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- A note on embeddings for the Augmented Lagrange Method
- Complexity and performance of an augmented Lagrangian algorithm
- Constrained composite optimization and augmented Lagrangian methods
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
- Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization
- Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints
- On the Complexity of an Augmented Lagrangian Method for Nonconvex Optimization
- Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
- Complexity of a projected Newton-CG method for optimization with bounds
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
- Hessian barrier algorithms for non-convex conic optimization
- A first-order method for nonconvex-strongly-concave constrained minimax optimization
- A first-order augmented Lagrangian method for constrained minimax optimization
- Complexity analysis of inexact cubic-regularized primal-dual methods for finding second-order stationary points
- First-order methods for nonsmooth nonconvex functional constrained optimization with or without Slater points
- An augmented Lagrangian method for nonconvex composite optimization problems with nonlinear constraints
- A concise and friendly introduction to the analysis of algorithms for continuous nonlinear optimization
This page was built for publication: On the complexity of an augmented Lagrangian method for nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077039)
