Skip to Main content Skip to Navigation
Conference papers

Benchmarking the Nelder-Mead Downhill Simplex Algorithm With Many Local Restarts

Nikolaus Hansen 1, 2
1 TAO - Machine Learning and Optimisation
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
Abstract : We benchmark the Nelder-Mead downhill simplex method on the noisefree BBOB-2009 testbed. A multistart strategy is applied on two levels. On a local level, at least ten restarts are conducted with a small number of iterations and reshaped simplex. On the global level independent restarts are launched until $10^5 D$ function evaluations are exceeded, for dimension $D\ge20$ ten times less. For low search space dimensions the algorithm shows very good results on many functions. It solves 24, 18, 11 and 7 of 24 functions in 2, 5, 10 and 40-D.
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download
Contributor : Nikolaus Hansen <>
Submitted on : Thursday, May 7, 2009 - 1:13:20 PM
Last modification on : Wednesday, September 16, 2020 - 5:06:55 PM
Long-term archiving on: : Thursday, June 10, 2010 - 9:05:23 PM


Files produced by the author(s)


  • HAL Id : inria-00382104, version 1



Nikolaus Hansen. Benchmarking the Nelder-Mead Downhill Simplex Algorithm With Many Local Restarts. ACM-GECCO Genetic and Evolutionary Computation Conference, Jul 2009, Montreal, Canada. ⟨inria-00382104⟩



Record views


Files downloads