Benchmarking the Nelder-Mead Downhill Simplex Algorithm With Many Local Restarts - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

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

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.
Fichier principal
Vignette du fichier
hansen2009bnm.pdf (407.98 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00382104 , version 1 (07-05-2009)

Identifiers

  • HAL Id : inria-00382104 , version 1

Cite

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⟩
375 View
708 Download

Share

Gmail Mastodon Facebook X LinkedIn More