๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Pure adaptive search for finite global optimization

โœ Scribed by Z. B. Zabinsky; G. R. Wood; M. A. Steel; W. P. Baritompa


Publisher
Springer-Verlag
Year
1995
Tongue
English
Weight
363 KB
Volume
69
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Adaptive random search in Quasi-Monte Ca
โœ 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