An efficient sequential quadratic programming algorithm for nonlinear programming
Author:
- Zhibin ZhuZZZhibin Zhu
- 1 March 2005
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 175 (2) , 447-464
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A Computationally Efficient Feasible Sequential Quadratic Programming AlgorithmSIAM Journal on Optimization, 2001
- A superlinearly convergent method of feasible directionsApplied Mathematics and Computation, 2000
- A Variant of the Topkis--Veinott Method for Solving Inequality Constrained Optimization ProblemsApplied Mathematics & Optimization, 2000
- A generalization of the norm-relaxed method of feasible directionsApplied Mathematics and Computation, 1999
- Nonlinear equality constraints in feasible sequential quadratic programming∗Optimization Methods and Software, 1996
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problemsJournal of Optimization Theory and Applications, 1995
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization ProblemsSIAM Journal on Control and Optimization, 1987
- A successive quadratic programming algorithm with global and superlinear convergence propertiesMathematical Programming, 1986
- A surperlinearly convergent algorithm for constrained optimization problems1982
- Superlinearly convergent variable metric algorithms for general nonlinear programming problemsMathematical Programming, 1976