✦ LIBER ✦

On the convergence of a class of algorithms using linearly independent search directions

✍ Scribed by Mokhtar S. Bazaraa; C. M. Shetty; Jamie J. Goode

Publisher: Springer-Verlag
Year: 1980
Tongue: English
Weight: 200 KB
Volume: 18
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01588300

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New convergence theorems for a class of

New convergence theorems for a class of feasible directions algorithms

✍ E. Polak; S. Tishyadhigama 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 603 KB

On the uniform nonsingularity of matrice

On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms

✍ P. L. Toint; F. M. Callier 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 699 KB

On the uniqueness of search directions i

On the uniqueness of search directions in variable-metric algorithms

✍ N. Adachi 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 690 KB

On a class of minimization algorithms wi

On a class of minimization algorithms with over-linear convergence

✍ Yu.M. Danilin 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 759 KB

On the convergence of multiplicative ite

On the convergence of multiplicative iterative algorithms with inexact line search

✍ Xiaoguang Yang 📂 Article 📅 1997 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 285 KB

The convergence of an interior-point met

The convergence of an interior-point method using modified search directions in final iterations

✍ Weichung Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 765 KB

provide an asymptotic analysis of a primal-dual algorithm for linear programming that uses modified search directions in the final iterations. The algorithm determines the search directions by solving the normal equations using the preconditioned conjugate gradient algorithm. Small dual slack variab