DMCA
Black-box optimization benchmarking of the GLOBAL method
Cached
Download Links
| Citations: | 2 - 1 self |
BibTeX
@MISC{Pál_black-boxoptimization,
author = {László Pál and Tibor Csendes},
title = {Black-box optimization benchmarking of the GLOBAL method},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
GLOBAL is a multistart type stochastic method for bound constrained global optimization problems. Its goal is to find the best local minima that are potentially global. For this reason it involves a combination of sampling, clustering, and local search. The role of clustering is to reduce the number of local searches by forming groups of points around the local minimizers from a uniform sampled domain and to start few local searches in each of those groups. We evaluate the performance of the GLOBAL algorithm on the BBOB-2009 noiseless testbed, containing problems which reflect the typical difficulties arising in real-word applications. The results show that up to a small function evaluation budget, GLOBAL performs well. We improved the parametrization of it and compared the performance with the MATLAB R2010a GlobalSearch algorithm on the BBOB-2010 noiseless testbed between dimensions 2 and 20. According to the results the studied methods perform similar.
Keyphrases
local search global method black-box optimization benchmarking local minimizers bbob-2010 noiseless local minimum real-word application bbob-2009 noiseless testbed matlab r2010a globalsearch algorithm global algorithm typical difficulty global optimization problem multistart type stochastic method studied method small function evaluation budget
