Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

GECCO
2009
Springer

favoriteEmaildiscussreport

134views Optimization» more GECCO 2009»

Benchmarking the BFGS algorithm on the BBOB-2009 function testbed

13 years 9 months ago

Benchmarking the BFGS algorithm on the BBOB-2009 function testbed

Download sci2s.ugr.es

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 search space dimension, resulting in the algorithm solving six functions. Categories and Subject Descriptors

Raymond Ros

Real-time Traffic

Function Evaluations | GECCO 2009 | Noiseless Bbob-2009 | Optimization | Search Space Dimension |

claim paper

Related Content

» Benchmarking the BFGS algorithm on the BBOB2009 noisy testbed

» Benchmarking the NEWUOA on the BBOB2009 function testbed

» Benchmarking the 11CMAES on the BBOB2009 function testbed

» Benchmarking the 11 evolution strategy with onefifth success rule on the BBOB2009 function...

» Benchmarking sepCMAES on the BBOB2009 function testbed

» Benchmarking the 11CMAES on the BBOB2009 noisy testbed

» Benchmarking sepCMAES on the BBOB2009 noisy testbed

» Benchmarking the 11ES with onefifth success rule on the BBOB2009 noisy testbed

» Benchmarking the pure random search on the BBOB2009 testbed

Post Info
More Details (n/a)

Added	24 Jul 2010
Updated	24 Jul 2010
Type	Conference
Year	2009
Where	GECCO
Authors	Raymond Ros

Comments (0)