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)
Methods for nonlinear constraints. (English) Zbl 0548.90058
Nonlinear optimization, Proc. NATO Adv. Res. Inst., Cambridge/Engl. 1981, NATO Conf. Ser., Ser. II, 185-211 (1982).

[For the entire collection see Zbl 0541.00004.]

A brief description of various types of methods for solving nonlinear programming problems is given. Each of these types is assessed in regard to efficiency and reliability, both in practice and in regard to the convergence properties of the method. Special attention is given to the use of an exact 1 penalty function, and a method based on the sequential solution of 1 quadratic programming problems.

MSC:
90C30Nonlinear programming
49M37Methods of nonlinear programming type in calculus of variations
65K05Mathematical programming (numerical methods)
90-02Research monographs (optimization)
90C20Quadratic programming