[1]Magne D Q,Polak E. A superlinearly convergent algorithm for constrai ned optimization problems. Mathematical Programming Study, 1982, 16:  45-61

[2]Boggs P T,Tolle J W, Wang P On the local convergence of QuasiNewto n methods for constrained optimization.SIAM Journal of Control and Optimization , 1982,20(2): 161-171

[3]Biggs M C.On the convergence of some constrained minimization algorithm  based on recursive quadratic programming. Journal of Institute of Mathematics a nd Its Application, 1979,21: 67-82

[4]Fukushima M.A successive quadratic programming algorithm with global and  superlinear convergence properties. Mathematical Programming,1986,35:253-264

[5]Panier E R, Tits A L.A superlinearly convergent feasible method for the solution of inequality constrained optimization problems. SIAM Journal of Con trol and Optimization, 1987, 25: 934-950

[6]Panier E R, Tits A L, Herskovits J N.A QP free, globally convergent ,locally superlinearly convergent algorithm for inequality constrained optimiza tion. SIAM Journal of Control and Optimization, 1988, 36: 788-811

[7]He G P, Diao B Q, Gao Z Y. A SQP algorithm with nonmonotone linear s earch for general nonlinear constrained optimization problem. Journal of Computa tional Mathematics, 1997, 15(2): 179-192

[8]Gao Z Y, Wu F, Lai Y L. A superlinearly convergent algorithm of the s equential systems of linear equations for nonlinear optimization problems. Chine se Science Bulletin, 1994, 39(23): 1946-1951

[9]Gao Z Y, He G P, Wu F. Sequential systems of linear equations algorit hm for nonlinear optimization problems with general constraints. Journal of Opti mization Theory and Applications, 1997, 95: 371-397

[10]Bonnans J F, Launay G. Sequential quadratic programming wit h penalization of the displacement. SIAM Journal of Optimization, 1995, 15 (4): 792-812

[11]Facchinei F. Robust recursive quadratic programming algorithm model with  global and superlinear convergence properties. Journal of Optimization Theory a nd Applications, 1997, 92(3): 543-579

[12]Gao Z Y, He G P, Wu F. An algorithm of sequential systems of linear  equations for nonlinear optimization problems with arbitrary initial point. Scie nce in China (Series A), 1997, 40(2): 1-10

[13]Facchinei F, Lucidi S. Quadratically and superlinearly convergent algor ithms for the solution of inequality constrained minimization problems. Journal  of Optimization Theory and Applications, 1995, 85(2): 265-289

[14]Powell M J D. Variable metric methods for constrained optimization, In : Bachem A, Grotschel M, Korte B, ed. Math. Prog: the State of Art, Bonn. Berlin : SpringerVerlag, 1983. 288-311

[15]Xu Y F, Wang W, Gao Z Y. The algorithm of sequential KKT equations b y nonmonotone search for arbitrary initial point. Computational Optimization and  Applications, 2001, 18: 221-232

[16]Spellucci P. An SQP method for general nonlinear programs using only equ ality constrained subproblems. Mathematical Programming, 1988, 82(3) : 413-448

[17]Burke J V, Han S P. A robust sequential quadratic programming meth od. Mathematical Programming, 1989, 43: 277-303

[18]Gao Z Y, He G P, Wu F. An algorithm of sequential systems of linear  equation for nonlinear optimization problems, Part I Inequality constrained pr oblems. Technical Report of Institute of Applied Mathematics, Academia Sinica,1994:94-31

[19]Qi H D, Qi L Q. A new QPfree, globally convergent, locally superline arly convergent algorithm for inequality constrained optimization. SIAM Journal  of Control and Optimization, 2000, 11: 113-132

[20]Xu Y F, Wang W. A QPfree and superlinearly convergent algorithm for i nequality constrained optimization. Acta Mathematica Scientia,2001,21B: 121-130