A Comparison of Global Search Algorithms for Continuous Black Box Optimization
Authors:
- 1 December 2012
- journal article
- research article
- Published by MIT Press in Evolutionary Computation
- Vol. 20 (4) , 509-541
Abstract
Four methods for global numerical black box optimization with origins in the mathematical programming community are described and experimentally compared with the state of the art evolutionary method, BIPOP-CMA-ES. The methods chosen for the comparison exhibit various features that are potentially interesting for the evolutionary computation community: systematic sampling of the search space (DIRECT, MCS) possibly combined with a local search method (MCS), or a multi-start approach (NEWUOA, GLOBAL) possibly equipped with a careful selection of points to run a local optimizer from (GLOBAL). The recently proposed “comparing continuous optimizers” (COCO) methodology was adopted as the basis for the comparison. Based on the results, we draw suggestions about which algorithm should be used depending on the available budget of function evaluations, and we propose several possibilities for hybridizing evolutionary algorithms (EAs) with features of the other compared algorithms.Keywords
This publication has 11 references indexed in Scilit:
- Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-20092010
- The GLOBAL optimization method revisitedOptimization Letters, 2007
- The NEWUOA software for unconstrained optimization without derivatives2006
- Complete search in continuous global optimization and constraint satisfaction2004
- Global Optimization by Multilevel Coordinate SearchJournal of Global Optimization, 1999
- Iterative Methods for Optimization1999
- Lipschitzian optimization without the Lipschitz constantJournal of Optimization Theory and Applications, 1993
- Stochastic global optimization methods part I: Clustering methodsMathematical Programming, 1987
- A stochastic method for global optimizationMathematical Programming, 1982
- A Simplex Method for Function MinimizationThe Computer Journal, 1965