A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM

DOI10.1142/S021759590800178XzbMath1163.90701OpenAlexW2048055944MaRDI QIDQ3526524

Yong-Hong Ren, Yue Wu, Xiantao Xiao, Li-wei Zhang

Publication date: 25 September 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021759590800178x

zbMATH Keywords

condition numbernonconvex optimizationnonlinear Lagrangiandual algorithmdual function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints, Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved, Convergence of an augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints, The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity, A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems

Cites Work

• Unnamed Item
• Primal-dual nonlinear rescaling method for convex optimization
• Modified barrier functions (theory and methods)
• Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints
• Nonlinear rescaling vs. smoothing technique in convex optimization
• Zero duality gap for a class of nonconvex optimization problems
• A nonlinear Lagrangian based on Fischer-Burmeister NCP function
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• Unconstrained Lagrangians in Nonlinear Programming
• Smooth Optimization Methods for Minimax Problems
• Nonlinear leastpth optimization and nonlinear programming
• Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
• Penalty/Barrier Multiplier Methods for Convex Programming Problems
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• Log-sigmoid multipliers method in constrained optimization