Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization

DOI10.1016/j.cam.2021.113608zbMath1469.90117OpenAlexW3152722818MaRDI QIDQ2029687

Hezhi Luo, Jianfang Yang, Huixian Wu, Fang-Ying Zheng

Publication date: 3 June 2021

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2021.113608

zbMATH Keywords

constrained nonconvex optimization\(p\)th power Lagrangian functionconvergence to global solutionmodified \(p\)th power Lagrangian methods

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Uses Software

• ADMBB

Cites Work

• Unnamed Item
• On the convergence of the exponential multiplier method for convex programming
• Handbook of test problems in local and global optimization
• Local saddle points and convexification for nonconvex optimization problems
• Nonlinear rescaling vs. smoothing technique in convex optimization
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
• Convexification and existence of a saddle point in a \(p\)th-power reformulation for nonconvex constrained optimization.
• Zero duality gap for a class of nonconvex optimization problems
• Global minimization using an augmented Lagrangian method with variable lower-level constraints
• Local convexification of the Lagrangian function in nonconvex optimization
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
• Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update
• A note on the existence of saddle points ofp-th power Lagrangian for constrained nonconvex optimization
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Convergence properties of augmented Lagrangian methods for constrained global optimization
• Combined Primal–Dual and Penalty Methods for Convex Programming
• Saddle point generation in nonlinear nonconvex optimization
• 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
• On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
• Existence of a saddle point in nonconvex constrained optimization.

This page was built for publication: Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization