✦ LIBER ✦

Achieving the Ergodically Optimal Convergence Rate for a One-Dimensional Minimization Problem

✍ Scribed by H.P. Wynn; A.A. Zhigljavsky

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 937 KB
Volume: 11
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.1995.1008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the optimally convergent splines diff

On the optimally convergent splines difference scheme for one-dimensional reaction-diffusion problem

✍ Mirjana Stojanović 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 516 KB

A One-Dimensional Optimization Algorithm

A One-Dimensional Optimization Algorithm and Its Convergence Rate under the Wiener Measure

✍ James M. Calvin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 258 KB

In this paper we describe an adaptive algorithm for approximating the global minimum of a continuous function on the unit interval, motivated by viewing the function as a sample path of a Wiener process. It operates by choosing the next observation point to maximize the probability that the objectiv

A rigorous justification and estimation

A rigorous justification and estimation of the rate of convergence for the partial domain method in two-dimensional eigenvalue problems for the Laplace operator

✍ L.T. Poznyak 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 734 KB