48 search results - page 1 / 10 » Benchmarking the BFGS algorithm on the BBOB-2009 function te... |
GECCO
2009
Springer
13 years 9 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
13 years 9 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
13 years 9 months ago
2009
Springer
The NEWUOA which belongs to the class of Derivative-Free optimization algorithms is benchmarked on the BBOB-2009 noisefree testbed. A multistart strategy is applied with a maximum...
GECCO
2009
Springer
13 years 9 months ago
2009
Springer
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...
GECCO
2009
Springer
13 years 9 months ago
2009
Springer
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...