✦ LIBER ✦

Optimal random non-adaptive algorithm for global optimization of Brownian motion

✍ Scribed by Hisham Al-Mharmah; James M. Calvin

Publisher: Springer US
Year: 1996
Tongue: English
Weight: 453 KB
Volume: 8
Category: Article
ISSN: 0925-5001
DOI: 10.1007/bf00229303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Randomized algorithm for global optimiza

Randomized algorithm for global optimization with bounded memory

✍ James M. Calvin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Convergence qualification of adaptive pa

Convergence qualification of adaptive partition algorithms in global optimization

✍ János Pintér 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 1021 KB

Adaptive random search in Quasi-Monte Ca

Adaptive random search in Quasi-Monte Carlo methods for global optimization

✍ Guiyuan Lei 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 569 KB

## Quasi-Monte Carlo random search is useful in nondifferentiable optimization. Borrowing ideas of population evolution from genetic algorithms, we introduce an adaptive random search in quasi-Monte Carlo methods (AQMC) for global optimization. Adaptive technique is used such that local search can

Comparison of partition evaluation measu

Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization

✍ Linet Özdamar; Melek Demirhan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Average Performance of Passive Algorithm

Average Performance of Passive Algorithms for Global Optimization

✍ J.M. Calvin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 284 KB

An algorithm for global optimization of

An algorithm for global optimization of Lipschitz continuous functions

✍ C. C. Meewella; D. Q. Mayne 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 593 KB