Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Genetic and Evolutionary Computation Conference
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
Benchmarking the NEWUOA on the BBOB-2009 function testbed
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Algorithm selection based on exploratory landscape analysis and cost-sensitive learning
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
In this paper, the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) on some noiseless functions are compared to those of the BI-POPulation Covariance Matrix Adaptation-Evolution Strategy (BIPOP-CMA-ES). The two algorithms were benchmarked on the BBOB 2009 noiseless function testbed. The comparison shows that NEWUOA outperforms BIPOP-CMA-ES on some functions like the Sphere or the Rosenbrock functions. Also the independent restart procedure used for NEWUOA allows it to perform better than BIPOP-CMA-ES on the Gallagher functions. Nevertheless, BIPOP-CMA-ES is faster and has a better success probability than NEWUOA in reaching target function values smaller than one on all other functions.