Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
IEEE Transactions on Evolutionary Computation - Special issue on computational finance and economics
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Benchmarking a weighted negative covariance matrix update on the BBOB-2010 noisy testbed
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Energy landscapes of atomic clusters as black box optimization benchmarks
Evolutionary Computation
| Hi-index | 0.00 |
We benchmark the BI-population CMA-ES on the BBOB-2009 noisy functions testbed. BI-population refers to a multistart strategy with equal budgets for two interlaced restart strategies, one with an increasing population size and one with varying small population sizes. The latter is presumably of little use on a noisy testbed. The BI-population CMA-ES could solve 29, 27 and 26 out of 30 functions in search space dimension 5, 10 and 20 respectively. The time to find the solution ranges between 100 D and 105 D2 objective function evaluations, where D is the search space dimension.