✦ LIBER ✦

Applications of a general convergence theory for outer approximation algorithms

✍ Scribed by William W. Hogan

Publisher: Springer-Verlag
Year: 1973
Tongue: English
Weight: 800 KB
Volume: 5
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580118

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the convergence of a class of outer a

On the convergence of a class of outer approximation algorithms for convex programs

✍ Masao Fukushima 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 719 KB

Epigraphical nesting: A unifying theory

Epigraphical nesting: A unifying theory for the convergence of algorithms

✍ J. L. Higle; S. Sen 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 946 KB

On a general localization theorem and so

On a general localization theorem and some applications in the theory of rational approximation

✍ V. A. Popov; J. Szabados 📂 Article 📅 1974 🏛 Akadmiai Kiad 🌐 English ⚖ 232 KB

Convergence of the iterative algorithm f

Convergence of the iterative algorithm for a general Hammerstein system identification

✍ Er-Wei Bai; Kang Li 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Some results of convergence acceleration

Some results of convergence acceleration for a general ϑ-type algorithm

✍ A. Fdil 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 876 KB

In this paper, we propose a general O-type algorithm for accelerating the convergence of sequences. It generalizes some known sequence transformations such as the O-algorithm, the iterated O2, the iterated A 2, and the T-algorithm. Some general convergence acceleration results are given. Some result

A globally convergent algorithm for dete

A globally convergent algorithm for determining approximate real zeros of a class of functions

✍ Merrell L. Patrick; Donald G. Saari 📂 Article 📅 1975 🏛 Springer Netherlands 🌐 English ⚖ 515 KB