A new SQP method of feasible directions for nonlinear programming

Applied Mathematics and Computation

Volumn 148, Issue 1, 2004, Pages 121-134

  Zhu, Zhibin ^a,b   Zhang, Kecun ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b GUILIN UNIVERSITY OF ELECTRONIC TECHNOLOGY   (China)

Author keywords

Global convergence; Method of feasible directions; Nonlinear programming; SQP method; Superlinear convergence

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATRIX ALGEBRA;

SEQUENTIAL QUADRATIC PROGRAMMING (SQP) METHOD;

NONLINEAR PROGRAMMING;

EID: 0142031030     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(02)00832-9     Document Type: Article

References (15)

1. Zoulendijk G. Methods of Feasible Directions. 1960;Elsevier, Amsterdam.
2. Bazaraa M.S., Shetly C.M. Nonlinear Programming Theory and Algorithms. 1979;John Wiley & Sons.
3. Topkis D.M., Veinett A.F. On the convergence of some feasible direction algorithms for nonlinear programming. SIAM J. Control. 5:1967;268-279.
4. Pironneau O., Polak E. On the rate of convergence of certain methods of centers. Math. Program. 2:1972;230-257.
5. Mayne D.Q., Polak E. A superlinearly convergent algorithm for constrained optimization problems. Math. Program. Study. 16:1982;45-61.
6. Han S.P. Superlinearly Convergent variable metric algorithm for general nonlinear programming problem. Math. Program. 11:1976;263-282.
7. Powell M.J.D. Convergence of Variable Metric Method for Nonlinear Constrained Optimization Calculations. Nonlinear Programming. vol. 3:1978;27-63 Academic Press, New York.
8. Panier E.R., Tits A.L. On combining feasibility descent and superlinear convergence in inequality constrained optimization. Math. Program. 59:1993;261-276.
9. Bonnans J.F., Panier E.R. Avoiding the Maratos effect by means of a nonmonotone line search. SIAM J. Number Anal. 29(4):1992;1187-1202.
10. Painier E.R., Tits A.L. A superlinearly convergent feasible method for the solution of inequality constrained optimization problems. SIAM J. Control Optim. 25(4):1987;934-950.
11. Chen X.B., Kostreva M.M. A generalization of the norm-relaxed method of feasible directions. Appl. Math. Computat. 102:1999;257-272.
12. Kostreva M.M., Chen X. A superlinearly convergent method of feasible directions. Appl. Math. Computat. 116:2000;245-255.
13. Robinson S.M. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming algorithms. Math. Program. 7:1974;1-16.
14. Facchinei F., Lucidi S. Quadraticly and superlinearly convergent for the solution of inequality constrained optimization problem. JOTA. 85(2):1995;265-289.
15. Charalambous C. Nonliner least. p th optimization and nonlinear programming Math. Program. 12:1977;195-225.