A new successive quadratic programming algorithm

DOI10.1007/BF02014586zbMath0787.90064OpenAlexW1978631862MaRDI QIDQ1210225

Zeng-xin Wei

Publication date: 25 May 1993

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

trust region methodsuccessive quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• A globally convergent algorithm for nonlinearly constrained optimization problems
• A globally convergent method for nonlinear programming
• A robust sequential quadratic programming method
• An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations
• A Family of Descent Functions for Constrained Optimization
• A successive quadratic programming algorithm with global and superlinear convergence properties
• A recursive quadratic programming algorithm that uses differentiable exact penalty functions
• An exact penalty function method with global convergence properties for nonlinear programming problems
• A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
• The watchdog technique for forcing convergence in algorithms for constrained optimization

This page was built for publication: A new successive quadratic programming algorithm