zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. (English) Zbl 0898.90119
The Barzilai-Borwein method [{\it J. Barzilai} and {\it J. M. Borwein}, IMA J. Numer. Anal. 8, No. 1, 141-148 (1988; Zbl 0638.65055)] requires few storage locations and very inPRRexpensive computations. Since a special step length is used no line search is required. A descent in the objective function is not guaranteed in every step. However, the global convergence has been established for the convex quadratic case. For the nonquadratic case the method needs to be incorporated in a globalization scheme. In this work the author proposes the combination of a nonmonotone line search strategy with the Barzilai-Borwein method (Global Barzilai-Borwein GBB). Thus the global convergence is guaranteed. For 15 test problems the new method is compared with two implementations of the conjugate gradient method (routine CONMIN of Shanno and Phua; Polak-Ribiere implementation $\text{PR}^+$ of Gilbert and Nocedal). As was expected CONMIN and $\text{PR}^+$ out perform the GBB in a number of iterations except for problems with a well-conditioned Hessian at the solution, in which case the number of iterations is similar.

90C30Nonlinear programming
90C52Methods of reduced gradient type
90C06Large-scale problems (mathematical programming)
Full Text: DOI