A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
From MaRDI portal
Publication:3526524
DOI10.1142/S021759590800178XzbMath1163.90701MaRDI QIDQ3526524
Yue Wu, Xiantao Xiao, Li-wei Zhang, Yong-Hong Ren
Publication date: 25 September 2008
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
90C26: Nonconvex programming, global optimization
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