Zhang H C, HagerWW. A nonmonotone line search technique and its application to unconstrained optimization[J]. SIAM Journal on Optimization, 2004, 14(4): 1043-1056.
[2]
Bertsekas D P. Nonlinear Programming[M]. Belmont: Athena Scientific, 1995.
[3]
Conn A R, Gould N I M and Toint PH L. Testing a class of methods for solving minimization problems with simple bounds on the variable[J]. Mathematics of Computation, 1988, 50: 399-430.
[4]
Moré J, Toraldo G. On the solution of large scale quadratic programming problem with bound constraints[J]. SIAM Journal on Optimization, 1991, 1: 93-113.
[5]
Friedlander A, Martinez J M, Santos S A. A new trust region algorithm for bound constrained minimization[J]. Applied Mathematics and Optimization, 1994, 30: 235-266.
[6]
Conn A R, Gould N I M, Toint Ph L. Trust Region Methods. MPS/SIAM Series on Optimization, Society for Industrial and Applied Mathematics (SIAM) , Philadelphia, PA, 2000.
[7]
Ulbrich M. Nonmonotone trust region methods for bound-constrained semi-smooth equation with application to nonlinear complementarity problems[J]. SIAM Journal on Optimization, 2001, 11: 889-917.
[8]
Birgin E G, Martinez J M, Raydan M. Nonmonotone spectral projected gradient methods on convex sets[J]. SIAM J Optim, 2000, 10: 1196-1211.
[9]
Dai Y H, Fletcher R. Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming[J]. Numer Math, 2005, 100: 21-47.
Yu Z S. Solving bound constrained optimization via a new nonmonotone spectral projected gradiet method[J]. Appl. Numer. Math. 2008, 58: 1340-1348.
[12]
Yu Z, Sun J, Qin Y. A multivariate spectral projected gradient method for bound constrained optimization[J]. J. Comput. Appl. Math. 2011, 235: 2263-2269.
