Importance of search-domain reduction in random optimization

Abstract

The importance of incorporating systematic search-domain reduction into random optimization is illustrated. In the absence of domain reduction, even an enormous number of function evaluations does not ensure convergence sufficiently close to the optimum as was recently reported by Sarma. However, when the search domain is reduced systematically after every iteration as recommended by Luus and Jaakola, convergence is obtained in a relatively small number of function evaluations, even when the initial search region is large and the starting point is far from the optimum.