Benchmarking the nelder-mead downhill simplex algorithm with many local restarts
暂无分享,去创建一个
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.
[1] Marco Antonio Luersen,et al. Globalized Nelder-Mead method for engineering optimization , 2002 .
[2] Raymond Ros,et al. Real-Parameter Black-Box Optimization Benchmarking 2009: Experimental Setup , 2009 .
[3] Anne Auger,et al. Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions , 2009 .