Sciweavers

31 search results - page 4 / 7
» Benchmarking CMA-EGS on the BBOB 2010 noisy function testbed
Sort
View
GECCO
2010
Springer
175views Optimization» more  GECCO 2010»
14 years 13 days ago
Benchmarking a weighted negative covariance matrix update on the BBOB-2010 noiseless testbed
We implement a weighted negative update of the covariance matrix in the CMA-ES—weighted active CMA-ES or, in short, aCMA-ES. We benchmark the IPOP-aCMA-ES and compare the perfor...
Nikolaus Hansen, Raymond Ros
GECCO
2010
Springer
237views Optimization» more  GECCO 2010»
14 years 13 days ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noiseless BBOB-2010 testbed
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD ....
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
GECCO
2010
Springer
188views Optimization» more  GECCO 2010»
13 years 11 months ago
Benchmarking real-coded genetic algorithm on noisy black-box optimization testbed
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
Thanh-Do Tran, Gang-Gyoo Jin
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
14 years 7 days 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
GECCO
2009
Springer
135views Optimization» more  GECCO 2009»
14 years 7 days ago
Benchmarking the (1+1)-ES with one-fifth success rule on the BBOB-2009 noisy testbed
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...
Anne Auger