A nonlinear Lagrangian based on Fischer-Burmeister NCP function
From MaRDI portal
Publication:2372014
DOI10.1016/j.amc.2006.10.084zbMath1119.65054MaRDI QIDQ2372014
Xiantao Xiao, Li-wei Zhang, Yong-Hong Ren
Publication date: 10 July 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.10.084
convergence; numerical results; condition number; error bound; nonlinear programming; penalty parameter; augmented Lagrangian; nonlinear Lagrangian; dual algorithm; dual function; Fischer-Burmeister NCP function
Related Items
The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization, A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual nonlinear rescaling method for convex optimization
- Enlarging the region of convergence of Newton's method for constrained optimization
- Modified barrier functions (theory and methods)
- A modified barrier-augmented Lagrangian method for constrained minimization
- Stable exponential-penalty algorithm with superlinear convergence
- Nonlinear rescaling and proximal-like methods in convex optimization
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Augmented non-quadratic penalty algorithms
- Zero duality gap for a class of nonconvex optimization problems
- 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
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- 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
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Log-sigmoid multipliers method in constrained optimization
