✦ LIBER ✦

Optimization of functions by quasi-random search methods

✍ Scribed by H. Niederreiter; K. McCurley

Publisher: Springer Vienna
Year: 1979
Tongue: English
Weight: 191 KB
Volume: 22
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02253124

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Optimization by random search with jumps

✍ Chunshien Li; Roland Priemer; Kuo-Hsiang Cheng 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

Global optimization by controlled random

Global optimization by controlled random search

✍ W. L. Price 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 726 KB

Solution quality of random search method

Solution quality of random search methods for discrete stochastic optimization

✍ Mahmoud H. Alrefaei; Ameen J. Alawneh 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 145 KB

Schedule optimization by the methods of

Schedule optimization by the methods of directed search

✍ D. I. Golenko; Yu. Ya. Tarnopol'skii 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 674 KB

Incorporation of gradient into random se

Incorporation of gradient into random search optimization

✍ Prof. Dr. Rein Luus; Dipl.-Ing. Paul Brenek 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 767 KB