Benchmarking the nelder-mead downhill simplex algorithm with many local restarts

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn 2009-January, Issue , 2009, Pages 2403-2408

  Hansen, Nikolaus ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Benchmarking; Black box optimization; Direct search; Evolutionary computation; Simplex downhill

Indexed keywords

CALCULATIONS; EVOLUTIONARY ALGORITHMS; LINEAR PROGRAMMING;

BLACK-BOX OPTIMIZATION; D-FUNCTION; DIRECT SEARCH; DOWNHILL SIMPLEX ALGORITHMS; DOWNHILL SIMPLEX METHOD; MULTISTART; NELDER-MEAD DOWNHILL SIMPLICES; NUMBER OF ITERATIONS; SEARCH SPACE DIMENSION; SIMPLEX DOWNHILL;

BENCHMARKING;

EID: 85020615863     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1570256.1570335     Document Type: Conference Paper

References (5)

1. S. Finck, N. Hansen, R. Ros, and A. Auger. Real-parameter black-box optimization benchmarking 2009: Presentation of the noiseless functions. Technical Report 2009/20, Research Center PPE, 2009.
2. N. Hansen, A. Auger, S. Finck, and R. Ros. Real-parameter black-box optimization benchmarking 2009: Experimental setup. Technical Report RR-6828, INRIA, 2009.
3. N. Hansen, S. Finck, R. Ros, and A. Auger. Real-parameter black-box optimization benchmarking 2009: Noiseless functions definitions. Technical Report RR-6829, INRIA, 2009.
4. M. Luersen and R. Le Riche. Globalized Nelder–Mead method for engineering optimization. Computers and Structures, 82(23-26):2251–2260, 2004.
5. J. Nelder and R. Mead. The downhill simplex method. Computer Journal, 7:308–313, 1965.