Sciweavers

Share
35 search results - page 1 / 7
» Benchmarking the (1 1)-CMA-ES on the BBOB-2009 function test...
Sort
View
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
10 years 8 months ago
Benchmarking the BFGS algorithm on the BBOB-2009 function testbed
The BFGS quasi-Newton method is benchmarked on the noiseless BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of 105 times the sea...
Raymond Ros
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
10 years 8 months ago
Benchmarking sep-CMA-ES on the BBOB-2009 function testbed
A partly time and space linear CMA-ES is benchmarked on the BBOB-2009 noiseless function testbed. This algorithm with a multistart strategy with increasing population size solves ...
Raymond Ros
GECCO
2009
Springer
153views Optimization» more  GECCO 2009»
10 years 8 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
150views Optimization» more  GECCO 2009»
10 years 8 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
147views Optimization» more  GECCO 2009»
10 years 8 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
books