32 search results - page 3 / 7 » Benchmarking the NEWUOA on the BBOB-2009 function testbed |
GECCO
2009
Springer
14 years 5 hour ago
2009
Springer
The (1+1)-ES with one-fifth success rule is one of the first and simplest stochastic algorithm proposed for optimization on a continuous search space in a black-box scenario. In...
GECCO
2009
Springer
14 years 5 hour ago
2009
Springer
We benchmark the BI-population CMA-ES on the BBOB2009 noisy functions testbed. BI-population refers to a multistart strategy with equal budgets for two interlaced restart strategi...
GECCO
2009
Springer
14 years 5 hour ago
2009
Springer
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 di...
GECCO
2009
Springer
14 years 5 hour 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
14 years 5 hour 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...