✦ LIBER ✦

CGS algorithms for constrained extremization of functions

✍ Scribed by R. F. Dennemeyer

Publisher: Springer
Year: 1979
Tongue: English
Weight: 689 KB
Volume: 27
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00933435

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

CGS algorithms for unconstrained minimiz

CGS algorithms for unconstrained minimization of functions

✍ R. F. Dennemeyer; E. H. Mookini 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 806 KB

Unconstrained approach to the extremizat

Unconstrained approach to the extremization of constrained functions

✍ H.Y. Huang; S. Naqvi 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 707 KB

An algorithm for constrained smoothing f

An algorithm for constrained smoothing functions

✍ M. T. Bozzini; C. Paracelli 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 339 KB

A Newton-type algorithm for solving an e

A Newton-type algorithm for solving an extremal constrained interpolation problem

✍ Krassimira Vlachkova 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 856 KB

Given convex scattered data in R 3 we consider the constrained interpolation problem of finding a smooth, minimal L p -norm (1 < p < ∞) interpolation network that is convex along the edges of an associated triangulation. In previous work the problem has been reduced to the solution of a nonlinear sy

An algorithm for computing constrained s

An algorithm for computing constrained smoothing spline functions

✍ Tommy Elfving; Lars-Erik Andersson 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 517 KB

Constrained extremal problems for famili

Constrained extremal problems for families of Stieltjes integrals

✍ George B. Leeman 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 320 KB