✦ LIBER ✦

On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class

✍ Scribed by Josef Stoer

Publisher: Springer-Verlag
Year: 1975
Tongue: English
Weight: 916 KB
Volume: 9
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01681353

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 convergence rate of the QL algori

On the convergence rate of the QL algorithm with Wilkinson's shift

✍ Guodong Zhang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 289 KB

On the updating scheme in a class of col

On the updating scheme in a class of collinear scaling algorithms for sparse minimization

✍ K. A. Ariyawansa; D. T. M. Lau 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 528 KB

On the rate of convergence of the minimi

On the rate of convergence of the minimization method along vectors in a given directional system

✍ V.N. Krutikov 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 113 KB

Mean square rates of convergence in the

Mean square rates of convergence in the continuous time simulated annealing algorithm on Rd

✍ Larry Goldstein 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 217 KB

On the rate of convergence in Strassen's

On the rate of convergence in Strassen's law of the iterated logarithm

✍ Karl Grill 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 198 KB

Let W(t) be a standard Wiener process and let 5 p be the compact class figuring in Strassen's law of the iterated logarithm. We investigate the rate of convergence to zero of the variable It is shown that as T~oo, (loglog T) -~ belongs to the upper class of this variable if e<~, and to the lower cl