✦ LIBER ✦

Linearization method for the discrete minimax problem

✍ Scribed by V. M. Panin

Publisher: Springer US
Year: 1981
Tongue: English
Weight: 515 KB
Volume: 16
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01078259

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quadratic rate of convergence of a linea

Quadratic rate of convergence of a linearization method for solving discrete minimax problems

✍ V.A. Daugavet; V.N. Malozemov 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 537 KB

A direct method of linearization for con

A direct method of linearization for continuous minimax problems

✍ K. C. Kiwiel 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 856 KB

Solution of discrete minimax problems by

Solution of discrete minimax problems by the method of dichotomy

✍ I.V. Romanovskii; N.P. Khristova 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 701 KB

Global convergence of second-order metho

Global convergence of second-order methods for convex problems of discrete minimax

✍ V. M. Panin 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 525 KB

Constructive method for solving a linear

Constructive method for solving a linear minimax problem of optimal control

✍ N. Chan 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 752 KB

On the Connection and Linearization Prob

On the Connection and Linearization Problem for Discrete Hypergeometric q-Polynomials

✍ R. Álvarez-Nodarse; J. Arvesú; R.J. Yáñez 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 185 KB

In the present paper, starting from the second-order difference hypergeometric Ž . equation on the non-uniform lattice x s satisfied by the set of discrete hypergeo-Ä 4 metric orthogonal q-polynomials p , we find analytical expressions of the expann Ž Ž .. Ž . sion coefficients of any q-polynomial r