论文信息 - Benchmarking the pure random search on the BBOB-2009 testbed

Benchmarking the pure random search on the BBOB-2009 testbed

We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [-5, 5]D, where D denotes the search space dimension. The maximum number of function evaluations chosen is 106 times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed.

Anne Auger | Raymond Ros | A. Auger | Raymond Ros

[1] Samuel H. Brooks. A Discussion of Random Methods for Seeking Maxima , 1958 .

[2] Anne Auger,et al. Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions , 2009 .

[3] Raymond Ros,et al. Real-Parameter Black-Box Optimization Benchmarking 2009: Experimental Setup , 2009 .