✦ LIBER ✦

An algorithm for solving linearly constrained minimax problems

✍ Scribed by Mokhtar S. Bazaraa; Jamie J. Goode

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 596 KB
Volume: 11
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(82)90110-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved SQP algorithm for solving mi

An improved SQP algorithm for solving minimax problems

✍ Zhibin Zhu; Xiang Cai; Jinbao Jian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 412 KB

An algorithm for linearly constrained co

An algorithm for linearly constrained convex nondifferentiable minimization problems

✍ Krzysztof C Kiwiel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 595 KB

An efficient algorithm for solving const

An efficient algorithm for solving constrained nonlinear programming problems

✍ Bruce R. Feiring; Don T. Phillips 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 784 KB

A mofified gub algorithm for solving lin

A mofified gub algorithm for solving linear minimax problems

✍ Takahito Kuno; Kouji Mori; Hiroshi Konno 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 426 KB 👁 2 views

Global optimization algorithms for linea

Global optimization algorithms for linearly constrained indefinite quadratic problems

✍ Panos M. Pardalos 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 663 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