Benchmarking the BFGS algorithm on the BBOB-2009 noisy testbed

13 years 9 months ago

Download sci2s.ugr.es

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 search space dimension. Categories and Subject Descriptors

Raymond Ros

Real-time Traffic

GECCO 2009 | Noisy Bbob-2009 | Optimization | Search Space Dimension | Subject Descriptors |

claim paper

» Benchmarking the pure random search on the BBOB2009 noisy testbed

» Benchmarking the 11CMAES on the BBOB2009 noisy testbed

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

» Benchmarking the NEWUOA on the BBOB2009 noisy testbed

» Benchmarking sepCMAES on the BBOB2009 noisy testbed

» Benchmarking a BIpopulation CMAES on the BBOB2009 noisy testbed

» Benchmarking the NEWUOA on the BBOB2009 function 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)

Sciweavers

Benchmarking the BFGS algorithm on the BBOB-2009 noisy testbed

GECCO 2009 | Noisy Bbob-2009 | Optimization | Search Space Dimension | Subject Descriptors |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers