Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming

Numerische Mathematik

Volumn 100, Issue 1, 2005, Pages 21-47

  Dai, Yu Hong ^a   Fletcher, Roger ^b  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b UNIVERSITY OF DUNDEE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 15544385032     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00211-004-0569-y     Document Type: Article

References (33)

1. Akaike, H.: On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method. Ann. Inst. Statist. Math. Tokyo 11, 1-17 (1959)
2. Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8, 141-148 (1988)
3. Bertsekas, D.P.: On the Goldstein-Levitin-Polyak gradient projection method. IEEE Transactions on Automatic Control 21, 174-184 (1976)
4. Birgin, E.G., Martínez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10, 1196-1211 (2000)
5. Birgin, E.G., Martínez, J.M., Raydan, M.: Inexact spectral projected gradient methods on convex sets. IMA J. Numer. Anal. 23, 539-559 (2003)
6. Brendel, M.: On two algorithms for the minimization of box constrained quadratic functions. MS344 honours project, Department of Mathematics, University of Dundee, 2001
7. Calamai, P.H., Moré, J.J.: Projected gradient methods for linearly constrained problems. Mathematical Programming 39, 93-116 (1987)
8. Dai, Y.H.: Alternate step gradient method. Optimization 52, 395-415 (2003)
9. Dai, Y.H., Fletcher, R.: On the asymptotic behaviour of some new gradient methods. Research report NA/212, Department of Mathematics, University of Dundee, 2003 (accepted by Mathematical Programming)
10. Dai, Y.H., Liao, L.-Z.: R-linear convergence of the Barzilai and Borwein gradient method. IMA J. Numer. Anal. 26, 1-10 (2002)
11. Dai, Y.H., Yuan, J.Y., Yuan, Y.Y.: Modified two-point stepsize gradient methods for unconstrained optimization. Computational Optimization and Applications 22, 103-109 (2002)
12. Dai, Y.H., Zhang, H.C.: An adaptive two-point stepsize gradient algorithm. Numerical Algorithms 27, 377-385 (2001)
13. De Angelis, P.L., Toraldo, G.: On the identification property of a projected gradient method. SIAM J. Numer. Anal. 30, 1483-1497 (1993)
14. Dembo, R.S., Tulowitzki, U.: On the minimization of quadratic functions subject to box constraints. Working Paper 71, School of Organization and Management, Yale University, New Haven, CT, 1983
15. Demyanov, V.F., Rubinov, A.R.: Approximate methods in optimization problems. Elsevier, New York, 1970
16. Fletcher, R.: On the Barzilai-Borwein Method. Research report NA/207, Department of Mathematics, University of Dundee, 2001
17. Friedlander, A., Martínez, J.M.: On the maximization of a concave quadratic function with box constraints. SIAM J. Optim. 4, 204-212 (1994)
18. Friedlander, A., Martínez, J.M., Molina, B., Raydan, M.: Gradient method with retards and generalizations. SIAM J. Numer. Anal. 36, 275-289 (1999)
19. Galligani, E., Ruggiero, V., Zanni, L.: Variable projection methods for large-scale quadratic optimization in data analysis applications. In: Equilibrium Problems and Variational Models, F. Giannessi, A. Maugeri, P.M. Pardalos (eds.), Nonconvex Optim. and Its Applic., Kluwer Academic PUbl. To appear, 2002
20. Goldstein, A.A.: Convex programming in Hubert space. Bulletin of the American Mathematical Society 70, 709-710 (1964)
21. Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton's method. SIAM J. Numer. Anal. 23, 707-716 (1986)
22. Grippo, L., Sciandrone, M.: Nonmonotone globalization techniques for the BarzilaiBorwein gradient method. Computational Optimization and Applications 23, 143-169 (2002)
23. Levitin, E.S., Polyak, B.T.: Constrained minimization problems. USSR Computational Mathematics and Mathematical Physics 6, 1-50 (1966)
24. Moré, J., Toraldo, G.: Algorithms for bound constrained quadratic programming problems. Numer. Math. 55, 377-400 (1989)
25. Moré, J., Toraldo, G.: On the solution of large quadratic programming problems with bound constraints. SIAM J. Optim. 1, 93-113 (1991)
26. Polyak, B.T.: The conjugate gradient method in extremal problems. USSR Comput. Math. and Math. Phys. 9, 94-112 (1969)
27. Raydan, M.: On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal. 13, 321-326 (1993)
28. Raydan, M.: The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26-33 (1997)
29. Serafini, T., Zanghirati, G., Zanni, L.: Gradient Projection Methods for Quadratic Programs and Applications in Training Support Vector Machines. Research report, 2003
30. Toint, Ph.L.: A non-monotone trust region algorithm for nonlinear optimization subject to convex constraints. Math. Prog. 77, 69-94 (1997)
31. Wright, S.J.: Implementing proximal point methods for linear programming. Journal of Optimization Theory and Applications 65, 531-554 (1990)
32. Yang, E.K., Tolle, J.W.: A class of methods for solving large, convex quadratic programs subject to box constraints. Math. Prog. 51, 223-228 (1991)
33. Zanghirati, G., Zanni, L.: A parallel solver for large quadratic programs in training support vector machines. Parallel Computing. To appear, 2003