The Barzilaiai and Borwein gradient method for the large scale unconstrained minimization problem

SIAM Journal on Optimization

Volumn 7, Issue 1, 1997, Pages 26-33

  Raydan, Marcos ^a  

^a FACULTAD DE CIENCIAS   (Venezuela)

Author keywords

Barzilai and borwein method; Conjugate gradient method; Nonmonotone line search; Unconstrained optimization

Indexed keywords

EID: 0031542191     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494266365     Document Type: Article

References (20)

1. J. BARZILAI AND J. M. BORWEIN, Two point step size gradient methods, IMA J. Numer. Anal., 8 (1998), pp. 141-148.
2. A. BUCKLEY AND A. LENIR, QN-like variable storage conjugate gradients, Math. Programming, 27 (1983), pp. 155-175.
3. J. E. DENNIS, JR. AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
4. R. FLETCHER, Practical Methods of Optimization, John Wiley, New York, 1987.
5. R. FLETCHER, Low storage, methods for unconstrained optimization, in Lectures in Applied Mathematics, Vol. 26, American Mathematical Society, Providence, RI, 1990, pp. 165-179.
6. A. FRIEDLANDER, J. M. MATINEZ, AND M. RAYDAN, A new method for large-scale box constrained convex qúadratic minimization problems, Optim. Methods and Software, 5 (1995), pp. 57-74.
7. N. K. GARG AND R. A. TAPIA, QDN: A Variable Storage Algorithm for Unconstrained Optimization, Technical report, Department of Mathematical Sciences, Rice University, Houston, TX, 1977.
8. J. C. GILBERT AND J. NOCEDAL, Global convergence properties of conjugate gradient methods for optimization, SIAM J. Optim., 2 (1992), pp. 21-42.
9. W. GLUNT, T. L. HAYDEN, AND M. RAYDAN, Molecular conformations from distance matrices, J. Comput. Chem., 14 (1993), pp. 114-120.
10. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A nonmonotone, line search technique for Newton's method, SIAM J. Numer. Anal., 23 (1986), pp. 707-716.
11. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A class of nonmonotone stabilization methods in unconstrained optimization, Numer. Math., 59 (1991), pp. 779-805.
12. J. J. MORÉ, B. S. GARBOW, AND K. E. HILLSTROM, Testing unconstrained optimization software, ACM Trans. Math. Software, 7 (1981), pp. 17-41.
13. J. J. MORÉ AND D. J. THUENTE, On line search algorithms with guaranteed sufficient decrease, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1990, preprint MCS-P153-0590.
14. J. NOCEDAL, Theory of algorithms for unconstrained optimization, Acta Numerica, 1 (1992), pp. 199-242,
15. [15) J. S. PANG, S. P. HAN, AND N. RANGARAJ, Minimization of locally lipschitzian functions, SIAM J. Optim., 1 (1991), pp. 57-82.
16. E. R. PANIER AND A. L. TITS, Avoiding the Maratos effect by means of a nonmonotone, line search I. General constrained problems, SIAM J. Numer. Anal., 28 (1991), pp. 1183-1195.
17. M. J. D. POWELL, Nonconvex minimization calculations and the conjugate gradient method, in Lecture Notes in Mathematics, Vol. 1066, Springer-Verlag, Berlin, 1984, pp. 122-141.
18. M. RAYDAN, On the Barzilai and Borwein choice of steplength for the gradient method, IMA J. Numer. Anal., 13 (1993), pp. 321-326.
19. D. F. SHANNO AND K. H. PHUA, Remark on algorithm 500: Minimization of unconstrained multivariate functions, ACM Trans. Math. Software, 6 (1980), pp. 618-622.
20. PH. L. TOINT Test Problems for Partially Separable Optimization and Results for the Routine PSPMIN, Report Nr 83/4, Department of Mathematics, Facultés Universitaires de Namur, Namur, Belgium, 1983.