17 search results - page 1 / 4 » Benchmarking the (1 1)-CMA-ES on the BBOB-2009 noisy testbed |
GECCO
2009
Springer
13 years 10 months ago
2009
Springer
A partly time and space linear CMA-ES is benchmarked on the BBOB-2009 noisy function testbed. This algorithm with a multistart strategy with increasing population size solves 10 f...
GECCO
2009
Springer
13 years 10 months ago
2009
Springer
The BFGS quasi-Newton method is benchmarked on the noisy BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of about 104 times the s...
GECCO
2009
Springer
13 years 10 months ago
2009
Springer
The NEWUOA which belongs to the class of DerivativeFree optimization algorithms is benchmarked on the BBOB2009 noisy testbed. A multistart strategy is applied with a maximum numbe...
GECCO
2009
Springer
13 years 10 months ago
2009
Springer
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 dimensi...
GECCO
2009
Springer
13 years 10 months ago
2009
Springer
We benchmark an independent-restart-(1+1)-CMA-ES on the BBOB-2009 noisy testbed. The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions d...