A successive quadratic programming method that uses new corrections for search directions

DOI10.1016/0377-0427(95)00216-2zbMath0856.65075OpenAlexW1990255495MaRDI QIDQ1919937

Boting Yang, Zhao-Yong You, Ke-Cun Zhang

Publication date: 24 February 1997

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

Full work available at URL: https://doi.org/10.1016/0377-0427(95)00216-2

zbMATH Keywords

global convergencenumerical resultsnonlinear programmingpenalty functionlocal superlinear convergencesuccessive quadratic programming method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
• An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
• Test example for nonlinear programming codes
• A successive quadratic programming algorithm with global and superlinear convergence properties
• A recursive quadratic programming algorithm that uses differentiable exact penalty functions
• A surperlinearly convergent algorithm for constrained optimization problems
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• A first order, exact penalty function algorithm for equality constrained optimization problems
• Some examples of cycling in variable metric methods for constrained minimization