2 research outputs found
Benchmarking the Pure Random Search on the BBOB-2009 Noisy Testbed
International audienceWe benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in , where denotes the search space dimension. The maximum number of function evaluations chosen is times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed