34 search results - page 1 / 7 » Benchmarking the BFGS algorithm on the BBOB-2009 noisy testb... |
174
click to vote
GECCO
2009
Springer
15 years 10 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...
148
Voted
GECCO
2009
Springer
15 years 10 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...
138
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
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...
144
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
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...
143
Voted
GECCO
2009
Springer
15 years 10 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...