[1] Powell M J D, Yuan Y. A recursive quadratic programming algorithm for equality constrained optimization.

Math Prog, 1986, 35: 265-278

[2] Brown A A, Biggs M C. Some effective methods for unconstrained optimization based on the solution of

system of ordinary differentiable equations. JOTA, 1989, 62: 211-224

[3] Mathmoud El-Alem. A global convergence theory for Dennis, El-Alem and Maciel’s class of trust region

algorithms for constrained optimization without assuming regularity. SIAM J Optim, 1999, 9(4): 965-990

[4] Yuan Y, Sun W. Optimization: Theory and Approach (in Chinese). Beijing: Academic Press, 1997

[5] Hiriart-Urruty J B, Strodiot J J, Nguyen V H. Generalized Hessian matrix and second-order optimality

conditions for problems with C1,1 data. Appl Math Optim, 1984, 11: 43-56

[6] Sun W, Desampaio R J B, Yuan J Y. Two algorithms for LC1 unconstrained optimization. J Comput

Math (China), 2000, 18(6): 621-632

[7] Qi L. Superlinearly convergent approximate Newton methods for LC1 optimization problems. Math Prog,

1994, 64: 277-294

[8] Bazaraa M S. Nonlinear Programming: Theory and Algorithms. New York: John Wiley & Sons Inc, 1979

[9] Han L X. On the convergence properties of an ODE algorithm for unconstrained optimization. J Comput

Math (China), 1993, 15: 449-455