References
- Daniel J.W., Stability of solution of definte quadratic program, Math. Program.,5(1973), 41-53. https://doi.org/10.1007/BF01580110
- Broyden, C.G., Dennis, J.E.,and More,J.J., On the local and superlinear convergence of quasi-Newton methods, J.Inst. Math. Appl., 12(1973), 223-245. https://doi.org/10.1093/imamat/12.3.223
- M.J.D.Powell, A fast algorithm for nonlinear constrained optimization calculations, in: G.A. Waston(Ed.), Numerical Analysis, Springer, Berlin, 1978.
- P.T. Boggs and J.W. Tolle, Sequential quadratic programming, Acta Numerica, 1(1995), 1-51.
- L.Qi and Y.F.Yang, A Globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization, AMR00/7, Applied Mathematics Report, University of New South Wales, Sydney, March 2000.
- P.Spellucci, A new technique for inconsistent QP probrems in the SQP methods, Math. Methods. Oper. Res., 47(1998), 355-400. https://doi.org/10.1007/BF01198402
- S.J.Wright, Superlinear convergent of a stabilized SQP to a degenerate solution, Comput. Optim. Appl., 11(1998), 253-275. https://doi.org/10.1023/A:1018665102534
- S.J.Wright,Modifying SQP for degenerate problems,Preprint ANL/MCS-p699-1097, Mathematics and Computer Science Division, Agronne National Laboratory, Oct,.17,1997.
- S. P. Han, A globally convergent method for nonlinear programming, J.Optim.Theory.Appl., 22(1977), 297-309. https://doi.org/10.1007/BF00932858
- F. Facchinei, Robust recursive quadratic programming algorithm model with global and superlinear convergence properties, J.Optim.Theory.Appl., 92(1997), 543-579. https://doi.org/10.1023/A:1022655423083
- M.M.Kostreva., X.Chen, A superlinearly convergent method of feasible directions, Appl.Math.Computation., 116(2000), 245-255. https://doi.org/10.1016/S0096-3003(99)00146-0
- E.R. Panier and A.L. Tits, A superlinearly convergent feasible method for the solution of inequality constrained optimization problems, SIAM Journal on Control. Optim., 25(1987), 934-950. https://doi.org/10.1137/0325051
- C.T. Lawrence., and A.L.Tits A computationally efficient feasible sequential quadratic programming algorithm, SIAM J.Optim., 11(2001), 1092-1118. https://doi.org/10.1137/S1052623498344562
- J. B. Jian, K. C. Zhang, S. J. Xue, A superlinearly and quadratically convergent SQP type feasible method for constrained optimization, Appl, Math. J. Chinese Univ, Ser. B, 15(2000), 319-331. https://doi.org/10.1007/s11766-000-0057-9
- J. B. Jian, Two extension models of SQP and SSLE algorithms for optimization and their superlinear and quadrtical convergence, Appl. Math. J. Chinese Univ, Ser. A, 16(2001), 435-444.
- J.B.Jian., Researches on superlinearly and quadratically convergent algorithm for nonlinearly constrained optimization, Ph.D.Thesis. School of Xi'an Jiaotong University. Xi'an, China, 2000.
- Facchinei.F., Lucidi.S., Quadratically and superlinearly convergent algorithms for the solution of inequality constrained optimization problems, J.Optim.Theory.Appl.,85(1995),265-289. https://doi.org/10.1007/BF02192227
- Zh.b.Zhu., An efficient sequential quadratic programming algorithm for nonlinear programming, J.Comput.Appl.Math., 175(2005), 447-464. https://doi.org/10.1016/j.cam.2004.07.001
- W. Hock, K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin Heidelberg New York, 1981.
- W. Hock, K. Schittkowski, More Test Examples for Nonlinear Programming Codes, Springer-Verlag, Berlin Heidelberg New York, 1987.