Sciweavers

32 search results - page 2 / 7
» Benchmarking the NEWUOA on the BBOB-2009 function testbed
Sort
View
GECCO
2009
Springer
153views Optimization» more  GECCO 2009»
13 years 9 months ago
Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed
In this paper, we benchmark the (1+1) Evolution Strategy (ES) with one-fifth success rule which is one of the first and simplest adaptive search algorithms proposed for optimiza...
Anne Auger
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
13 years 9 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...
Anne Auger, Nikolaus Hansen
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
13 years 9 months ago
Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed
We propose a multistart CMA-ES with equal budgets for two interlaced restart strategies, one with an increasing population size and one with varying small population sizes. This B...
Nikolaus Hansen
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
13 years 9 months ago
Benchmarking sep-CMA-ES on the BBOB-2009 noisy testbed
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...
Raymond Ros
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
13 years 9 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 noisy testbed
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...
Anne Auger, Nikolaus Hansen