[1]
|
R. H. Byrd, P. Lu, J. Nocedal. A limited-memory algorithm for bound constrained optimization. SIAM J. Sci. Stat. Com-put,
|
[2]
|
1995, 16(5): 1190-1208.
|
[3]
|
W. W. Hager, H. Zhang. A new active set algorithm for box constrained optimization. SIAM J. Optim, 2006, 17(2): 526- 557.
|
[4]
|
J. Moré, G. Toraldo. On the solution of large scale quadratic programming problem with bound constrains. SIAM J. Optim, 1991, 1(1): 93-113.
|
[5]
|
Z. S. Yu, Sun J, Qin Y. A multivariate spectral projected gradient method for bound constrained optimization. J. Comput. Appl. Math, 2011, 235(8): 2263-2269.
|
[6]
|
E. G. Birgin, G. M. Martinez, M. Raydan. Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim, 2000, 10(4): 1196-1211.
|
[7]
|
J. Barzilai, J. M. Borwein. Two-point step size gradient methods. IMA J. Numer. Anal, 1988, 8(1): 141-148.
|
[8]
|
R. Andreani, E. G. Birgin, J. M. Martínez, et al. Spectral projected gradient and variable metric methods for optimization with linear inequalities. IMA J. Numer. Anal, 2005, 25(2): 221-252.
|
[9]
|
E. G. Birgin, G. M. Marttínez. Larges-scale active-set box- constrained optimization method with spectral projected gradients. Comput. Optim Appl, 2002, 23(1): 101-125.
|
[10]
|
Y. Dai, R. Fletcher. Projected Barzilai-Borwein method for large-scale box-constrained quadratic programming. Numer. Math, 2005, 100(1): 21-47.
|
[11]
|
W. J. Leong, M. A. Hassan, M. Farid. A monotone gradient method via weak secant equation for unconstrained optimization. Taiwanese J. Math, 2010, 14(2): 413- 423.
|
[12]
|
L. Han, G. Yu, L. Guan. Multivariate spectral gradient method for unconstrained optimization. Appl Math Comput, 2008, 201(1-2): 621-630.
|
[13]
|
L. Grippo, F. Lampariello, S. Licidis. A nonmonotone line search technique for Newtons method. SIAM Journal on Numerical Analysis, 1986, 23(4): 26-33.
|