✦ LIBER ✦

Estimating the rate of convergence of the random search method

✍ Scribed by N. Z. Shor; M. B. Shchepakin

Publisher: Springer US
Year: 1976
Tongue: English
Weight: 200 KB
Volume: 10
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071540

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence of the random vortex method

✍ Jonathan Goodman 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 978 KB

Efficiency of the random search method

✍ Y.R. Rubinstein; G. Samorodnitsky 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 746 KB

The efficiency of random search algorithms for both deterministic and stochastic optimization problems is considered.

On the convergence of the LJ search meth

On the convergence of the LJ search method

✍ G. Gopalakrishnan Nair 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 291 KB

Estimating the convergence rate in the C

Estimating the convergence rate in the CLT for dependent random elements in a Hilbert space

✍ P. Gudinas 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 502 KB

Some estimates of the rate of convergenc

Some estimates of the rate of convergence for the cascadic conjugate-gradient method

✍ V.V. Shaidurov 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 446 KB

The paper deals with a cascadic conjugate-gradient method (shortly called the CCCalgorithm) which was proposed by P. Deufihard and can be considered as a simpler version of a multigrid (multilevel) method. We define it recurrently for discrete self-adjoint positive-definite problems on a sequence of

Estimate of rate of convergence in the C

Estimate of rate of convergence in the CLT for dependent two-dimensional random vectors

✍ P. Gudynas 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 406 KB