Localization of Search in Quasi-Monte Carlo Methods for Global Optimization

Abstract

Quasi-random search methods for the extreme values of multivariable functions suffer from the defect that they often require a very large number of function evaluations. We introduce and analyze the device of “localization of search” that speeds up these methods considerably.