The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem

The Barzilai and Borwein gradient method for the solution of large scale unconstrained minimization problems is considered. This method requires few storage locations and very inexpensive computations. Furthermore, it does not guarantee descent in the objective function and no line search is required. Recently, the global convergence for the convex quadratic case has been established. However, for the nonquadratic case, the method needs to be incorporated in a globalization scheme. In this work, a nonmonotone line search strategy that guarantees global convergence is combined with the Barzilai and Borwein method. This strategy is based on the nonmonotone line search technique proposed by Grippo, Lampariello, and Lucidi [SIAM J. Numer. Anal., 23 (1986), pp. 707--716]. Numerical results to compare the behavior of this method with recent implementations of the conjugate gradient method are presented. These results indicate that the global Barzilai and Borwein method may allow some significant reduction in the number of line searches and also in the number of gradient evaluations.

[1]  R. Tapia,et al.  QDN: a variable storage algorithm for unconstrained optimization , 1978 .

[2]  David F. Shanno,et al.  Remark on “Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]” , 1980, TOMS.

[3]  Jorge J. Moré,et al.  Testing Unconstrained Optimization Software , 1981, TOMS.

[4]  Albert G. Buckley,et al.  QN-like variable storage conjugate gradients , 1983, Math. Program..

[5]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[6]  M. Powell.  Nonconvex minimization calculations and the conjugate gradient method , 1984 .

[7]  L. Grippo,et al.  A nonmonotone line search technique for Newton's method , 1986 .

[8]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[9]  J. Borwein,et al.  Two-Point Step Size Gradient Methods , 1988 .

[10]  A. Tits,et al.  Avoiding the Maratos effect by means of a nonmonotone line search I. general constrained problems , 1991 .

[11]  Jong-Shi Pang,et al.  Minimization of Locally Lipschitzian Functions , 1991, SIAM J. Optim..

[12]  L. Grippo,et al.  A class of nonmonotone stabilization methods in unconstrained optimization , 1991 .

[13]  Jorge Nocedal,et al.  Global Convergence Properties of Conjugate Gradient Methods for Optimization , 1992, SIAM J. Optim..

[14]  Jorge Nocedal,et al.  Theory of algorithms for unconstrained optimization , 1992, Acta Numerica.

[15]  Marcos Raydan,et al.  Molecular conformations from distance matrices , 1993, J. Comput. Chem..

[16]  M. Raydan.  On the Barzilai and Borwein choice of steplength for the gradient method , 1993 .

[17]  F. Ana,et al.  A new method for large-scale box constrained convex quadratic minimization problems , 1995 .