A new Lagrangian-based first-order method for nonconvex constrained optimization

DOI10.1016/J.ORL.2023.04.006zbMath1525.90339arXiv2305.05009MaRDI QIDQ6106553

Jong Gwang Kim

Publication date: 3 July 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.05009

zbMATH Keywords

primal-dual methodnonconvex optimizationfirst-order methodLagrangian functionnonlinear equality constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10)

Cites Work

• Unnamed Item
• Unnamed Item
• An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Global convergence of ADMM in nonconvex nonsmooth optimization
• On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
• On the best achievable quality of limit points of augmented Lagrangian schemes
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
• Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
• Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
• Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
• On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming
• An Accelerated Linearized Alternating Direction Method of Multipliers
• Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
• A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
• Newton-Type Methods for Optimization and Variational Problems
• Practical Augmented Lagrangian Methods for Constrained Optimization
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming

This page was built for publication: A new Lagrangian-based first-order method for nonconvex constrained optimization