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 trust-region SQP-filter algorithm for general nonlinear programming. (English) Zbl 1038.90076
An SQP globally convergent algorithm for solving nonlinear C 2 -optimization problems with equality and inequality constraints is presented. The algorithm is based on trust region methods where filters are used instead of penalty functions. The filter concept was introduced by R. Flechter and S. Leyffer [Nonlinear programming without a panelty function, Math. Program. 91, 239–269 (2002; Zbl 1049.90088)]. It aims to avoid steps that are no improvement w.r.t. feasibility and objective value. Another feature of the algorithm is that the steps of the quadratic trust region subproblems are viewed as the sum of a normal step (for satisfying the constraints) and a tangential step (for reducing the objective function model of the subproblem). Therefore it is not required that the solution of the quadratic subproblems are determinied exactly.
90C30Nonlinear programming
65K05Mathematical programming (numerical methods)
90C55Methods of successive quadratic programming type