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 10 6 times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed.
benchmarking pure random search evolutionary computation black-box optimization monte-carlo