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 nonmonotone line search technique for Newton’s method. (English) Zbl 0616.65067
Newton’s method for finding the unrestricted minimum of a twice continuously differentiable function f is considered. To ensure convergence, a line search technique must be applied. Usually this is done such that a monotonic decrease in value of f is achieved. This - on the other hand - is known to eventually slow the rate of convergence. The authors propose a step-size rule, which may be considered as a generalization of Armijo’s rule in as much as a step is accepted if a certain improvement in function value is obtained not w.r.t. the last step but to one of the last M steps. By this a rule is obtained which is shown to preserve the global convergence properties without enforcing monotonic decrease in function values. By a number of examples it is demonstrated that there may be some gain in computational effort compared with the usual Armijo rule.
Reviewer: R.Hettich

MSC:
65K05Mathematical programming (numerical methods)
90C30Nonlinear programming