G-2011-28
A Parametric Simplex Search for Unconstrained Optimization Problem
, , and BibTeX reference
In this paper an effective modification to the original Nelder-Mead simplex method is suggested. It is shown that the new heuristic outperforms on average the original version of NM as well as its several modifications, showing especially its robustness in solving the standard functions. This result clearly indicates benefits of introducing randomness into a deterministic search procedure.
Published June 2011 , 15 pages
Document
G-2011-28.pdf (200 KB)