zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
A monotone gradient method via weak secant equation for unconstrained optimization. (English) Zbl 1203.90148
Summary: We present a new algorithm of steepest descent type. A new technique for steplength computation and a monotone strategy are provided in the framework of the Barzilai and Borwein method. In contrast with Barzilai and Borwein approach’s in which the steplength is computed by means of a simple approximation of the Hessian in the form of scalar multiple of identity and an interpretation of the secant equation, the new proposed algorithm considers another approximation of the Hessian based on the weak secant equation. By incorporating a simple monotone strategy, the resulting algorithm belongs to the class of monotone gradient methods with linearly convergence. Numerical results suggest that for non-quadratic minimization problem, the new method clearly outperforms the Barzilai-Borwein method.
MSC:
90C30Nonlinear programming
65K05Mathematical programming (numerical methods)