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)
Global convergence of a non-monotone trust-region filter algorithm for nonlinear programming. (English) Zbl 1130.90399
Hager, William W. (ed.) et al., Multiscale optimization methods and applications. Selected papers based on the presentation at the conference, Gainesville, FL, USA, February 26–28, 2004. New York, NY: Springer (ISBN 0-387-29549-6/hbk). Nonconvex Optimization and Its Applications 82, 125-150 (2006).
A non-monotone variant of the trust-region SQP-filter algorithm analyzed in D. F. Fletcher, B. Guo and T.A.G. Langrish [Appl. Math. Modelling 25, No. 8, 635–653 (2001; Zbl 1076.76535)] is defined, that directly uses the dominated area of the filter as an acceptability criterion for trial points. It is proved that, under reasonable assumptions and for all possible choices of the starting point, the algorithm generates at least a subsequence converging to a first-order critical point.
90C30Nonlinear programming
90C55Methods of successive quadratic programming type