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

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

โœ Scribed by Guiyuan Lei

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
569 KB
Volume
43
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 head for local maximum points quickly because the search direction and search step size are adjusted according to the previous search result. New individuals will be imported into the population adaptively according to population evolution degree. For quasi-random sequences with low discrepancy, the new generated successive points fill in the gaps in the previously generated distribution in E (the domain of function f), which ensures that E can be searched evenly and the global extremum can be found. In conclusion, the AQMC method not only speeds up the random search but also balances the global and local demand (adaptive equalization).

๐Ÿ“œ SIMILAR VOLUMES

A new measure of irregularity of distrib
A new measure of irregularity of distribution and quasi-Monte Carlo methods for global optimization
โœ Xiaoqun Wang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 980 KB

Measures of irregularity of distribution, such as discrepancy and dispersion, play a major role in quasi-Monte Carlo methods for integration and optimization. In this paper, a new measure of irregularity of distribution, called volume-dispersion, is introduced. Its relation to the discrepancy and tr

Tabu search method with random moves for
Tabu search method with random moves for globally optimal design
โœ Nanfang Hu ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 601 KB

Optimum engineering design problems are usually formulated as non-convex optimization problems of continuous variables. Because of the absence of convexity structure, they can have multiple minima, and global optimization becomes difficult. Traditional methods of optimization, such as penalty method

Smoothing techniques of global optimizat
Smoothing techniques of global optimization: Distance scaling method in searches for most stable Lennard-Jones atomic clusters
โœ Pillardy, Jaros?aw; Piela, Lucjan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 187 KB

Spatial averaging of the potential energy function facilitates the search for the most stable configuration of a molecular system. Recently some global optimization methods of this kind have been designed in the literature that rely on physical phenomena such as diffusion, wave function evolution in