The bbob Test Suite

The blackbox optimization benchmarking (bbob) test suite is COCO's standard test suite with 24 noiseless, single-objective and scalable test functions. Each function is provided in dimensions (2, 3, 5, 10, 20, 40) and in 15 instances, however also available for arbitrary dimensions and number of instances. Links to their definition with visualizations are provided in the table. ECDF of runtimes for 31 algorithms on the bbob suite

Only f1 and f5 are purely convex quadratic (f1) or purely linear in the region of interest $[-5,5]^n$ (f5).

See also N. Hansen et al (2010). Comparing Results of 31 Algorithms from the Black-Box Optimization Benchmarking BBOB-2009. Workshop Proceedings of the GECCO Genetic and Evolutionary Computation Conference 2010, ACM.

A list of all so-far benchmarked algorithms on the bbob suite together with their links to papers describing the experiment can be found in our bbob data archive. Postprocessed data can be found here. For detailed explanations of how to use the functions in a COCO benchmarking experiment, please go to the COCO code page on Github.