22 search results - page 2 / 5 » Benchmarking the pure random search on the BBOB-2009 testbed |
GECCO
2009
Springer
14 years 3 months 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 3 months ago
2009
Springer
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...
GECCO
2009
Springer
14 years 3 months 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...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
The NEWUOA which belongs to the class of DerivativeFree optimization algorithms is benchmarked on the BBOB2009 noisy testbed. A multistart strategy is applied with a maximum numbe...
GECCO
2009
Springer
14 years 3 months 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...