Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
From MaRDI portal
Recommendations
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- scientific article; zbMATH DE number 2190118
- Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
- An augmented Lagrangian trust region method for equality constrained optimization
- Some theoretical limitations of second-order algorithms for smooth constrained optimization
Cites work
- A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- An exact penalty function method with global convergence properties for nonlinear programming problems
- An Introduction to Optimization on Smooth Manifolds
- Complexity and performance of an augmented Lagrangian algorithm
- Complexity bounds for second-order optimality in unconstrained optimization
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- Efficient rank reduction of correlation matrices
- Exact Penalty Functions in Constrained Optimization
- Global rates of convergence for nonconvex optimization on manifolds
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3980094 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 3520162 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- Implementing a smooth exact penalty function for equality-constrained nonlinear optimization
- Implementing a smooth exact penalty function for general constrained nonlinear optimization
- Introduction to Riemannian Manifolds
- Introductory lectures on convex optimization. A basic course.
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- On second-order optimality conditions for nonlinear programming
- On the complexity of an augmented Lagrangian method for nonconvex optimization
- On the local quadratic convergence of the primal–dual augmented Lagrangian method
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
- Optimization for data analysis
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
Cited in
(1)
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)
