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)
Extremization of functions with equality constraints. (English) Zbl 0346.90044
MSC:
90C30Nonlinear programming
41A25Rate of convergence, degree of approximation
References:
[1]M.J.D. Powell, ”A method for non-linear constraints in minimization problems,” in:Optimization, Symposium of the Institute of Mathematics and its Applications, Keele, Ed. R. Fletcher (Academic Press, New York, 1969).
[2]D.A. Pierre,Optimization theory with applications (Wiley, New York, 1969).
[3]A.V. Fiacco and G.P. McCormick,Nonlinear programming: sequential unconstrained minimization techniques (Wiley, New York, 1968).
[4]E.M. Rosen, ”A review of quasi-Newton methods in nonlinear equation solving and unconstrained optimization,” in:Proceedings of the 21st National Conference of the Association for Computing Machinery (Academic Press, New York, 1966) pp. 37–42.
[5]J.G.P. Barnes, ”An algorithm for solving non-linear equations based on the secant method,”Computer Journal 8 (1965) 66–72. · Zbl 0254.65036 · doi:10.1093/comjnl/8.2.113
[6]B.A. Murtagh and R.W.H. Sargent, ”A constrained minimization method with quadratic convergence,” in:Optimization, Symposium of the Institute of Mathematics and its Application, Keele, Ed. R. Fletcher (Academic Press, New York, 1969).
[7]B. Noble,Applied linear algebra (Prentice-Hall, Englewoods-Cliffs, N.J., 1969).
[8]M.R. Chidambara, ”On the inverse of certain matrices,”IEEE Transactions on Automatic Control, Vol. AC-12 (1967) 214–215. · doi:10.1109/TAC.1967.1098550