Skip to main navigation Skip to search Skip to main content

Black-box optimization benchmarking of NEWUOA compared to BIPOP-CMA-ES: On the BBOB noiseless testbed

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication
Pages1519-1526
Number of pages8
DOIs
Publication statusPublished - 30 Aug 2010
Externally publishedYes
Event12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010 - Portland, OR, United States
Duration: 7 Jul 201011 Jul 2010

Publication series

NameProceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication

Conference

Conference12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010
Country/TerritoryUnited States
CityPortland, OR
Period7/07/1011/07/10

Keywords

  • Benchmarking
  • Black-box optimization
  • Derivative-free optimization
  • Evolution strategy

Fingerprint

Dive into the research topics of 'Black-box optimization benchmarking of NEWUOA compared to BIPOP-CMA-ES: On the BBOB noiseless testbed'. Together they form a unique fingerprint.

Cite this