Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
From MaRDI portal
Publication:6582431
DOI10.1007/S10957-024-02421-6MaRDI QIDQ6582431FDOQ6582431
Nicolas Boumal, Florentin Goyens, Armin Eftekhari
Publication date: 2 August 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Introductory lectures on convex optimization. A basic course.
- Efficient rank reduction of correlation matrices
- Exact Penalty Functions in Constrained Optimization
- An exact penalty function method with global convergence properties for nonlinear programming problems
- On second-order optimality conditions for nonlinear programming
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Complexity bounds for second-order optimality in unconstrained optimization
- Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization
- Introduction to Riemannian Manifolds
- Global rates of convergence for nonconvex optimization on manifolds
- Complexity and performance of an Augmented Lagrangian algorithm
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
- Optimization for Data Analysis
- On the complexity of an augmented Lagrangian method for nonconvex optimization
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- On the local quadratic convergence of the primal–dual augmented Lagrangian method
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
- Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
- An Introduction to Optimization on Smooth Manifolds
- A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
This page was built for publication: Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582431)