Benchmarking the pure random search on the BBOB-2009 noisy testbed

We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy 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. Categories and Subject Descriptors

• Type: Conference
• Year: 2009
• Where: GECCO
• Authors: Anne Auger, Raymond Ros
• Keywords: Candidate Solution, GECCO 2009, Optimization, Pure-Random-Search Algorithm, Search Space Dimension