Sciweavers

Share
34 search results - page 1 / 7
» Benchmarking the BFGS algorithm on the BBOB-2009 noisy testb...
Sort
View
GECCO
2009
Springer
161views Optimization» more  GECCO 2009»
10 years 9 months ago
Benchmarking the BFGS algorithm on the BBOB-2009 noisy testbed
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...
Raymond Ros
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
10 years 9 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
118views Optimization» more  GECCO 2009»
10 years 9 months ago
Benchmarking the pure random search on the BBOB-2009 noisy testbed
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...
Anne Auger, Raymond Ros
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
10 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
GECCO
2009
Springer
135views Optimization» more  GECCO 2009»
10 years 9 months 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
books