Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
type: Item
instance of: scholarly article
title: Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
author: Florentin Goyens
author: Armin Eftekhari
author: Nicolas Boumal
published in: Journal of Optimization Theory and Applications
publication date: 2024-08-02T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7891544
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: constrained optimization
zbMATH Keywords: augmented Lagrangian
zbMATH Keywords: complexity
zbMATH Keywords: Riemannian optimization
MaRDI profile type: Publication
cites work: Q5433140
cites work: On second-order optimality conditions for nonlinear programming
cites work: Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
cites work: Q3690580
cites work: Complexity and performance of an Augmented Lagrangian algorithm
cites work: Global rates of convergence for nonconvex optimization on manifolds
cites work: An Introduction to Optimization on Smooth Manifolds
cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
cites work: Complexity bounds for second-order optimality in unconstrained optimization
cites work: Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
cites work: An exact penalty function method with global convergence properties for nonlinear programming problems
cites work: Exact Penalty Functions in Constrained Optimization
cites work: Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization
cites work: Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization
cites work: Q4099846
cites work: Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
cites work: On the complexity of an augmented Lagrangian method for nonconvex optimization
cites work: Efficient rank reduction of correlation matrices
cites work: Q4040931
cites work: Introduction to Riemannian Manifolds
cites work: Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
cites work: Q3744948
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Q5593503
cites work: On the local quadratic convergence of the primal–dual augmented Lagrangian method
cites work: A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
cites work: Optimization for Data Analysis
cites work: A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
cites work: Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
DOI: 10.1007/S10957-024-02421-6
description: scientific article; zbMATH DE number 7891544