New sequential quadratic programming algorithm with consistent subproblems

DOI10.1007/BF02874433zbMath0893.90141OpenAlexW1999838626MaRDI QIDQ1368267

Yanlian Lai, Zi-You Gao, Guo-Ping He

Publication date: 28 September 1997

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02874433

zbMATH Keywords

global convergencesequential quadratic programmingpenalty functionlocal superlinear convergence\(\varepsilon\)-active set scheme

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items

Improved filter-SQP algorithm with active set for constrained minimax problems

Cites Work

• Unnamed Item
• Unnamed Item
• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
• A globally convergent method for nonlinear programming
• A robust sequential quadratic programming method
• Revisions of constraint approximations in the successive QP method for nonlinear programming problems
• A successive quadratic programming algorithm with global and superlinear convergence properties
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems