Pu D, Li K, Xue W. Convergence of QP-free infeasible methods for r inequality optimization problems [J]. J.of Tongji University, 2005, 33: 525-529.
Pu D, Zhou Y, Zhang Z. A QP free feasible method [J]. J. Comput. Math., 2004, {\bf 22}: 651-660.
Qi H, Qi L. A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization [J]. SIAM J.Optim., 2000, 11: 113-132.
Fletcher R, Leyffer S, Toint P. On the global convergence of a filter-SQP algorithm [J]. SIAM J. Optim., 2002, 12: 44-59.
Pu D, Jin Z. Nonmonotone line search technique for QP-free infeasible method [J]. J. of Tongji University, 2010, 38: 311-316.
Ribeiro A, Karas E W, Gonzaga C C. Global convergence of filter methods for nonlinear programming [J]. SIAM J. on Optimization, 2008, 19: 1231-1249.
Liu X, Yuan Y. A sequential quqdratic programming method a penalty function and a filter for equality constrained nonlinear programming [J]. SIAM J. on Optimization,2011, 91: 545-571.
Ulbrich M, Ulbrich S. Non-monotone trust region methods for nonlinear equality constrained optizization without a penalty function [J]. Math. Program., 2003, 95: 103-135.
Schittkowski K. More test examples for nonlinear programming codes [M]. Springer-Verlag, 1987. |