Gilding the lily: A variant of the Nelder-Mead algorithm based on golden-section search

Computational Optimization and Applications

Volumn 22, Issue 1, 2002, Pages 133-144

  Nazareth, Larry ^a   Tseng, Paul ^b  

^a WASHINGTON STATE UNIVERSITY   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Golden section direct search; Nelder Mead algorithm; Unconstrained minimization

Indexed keywords

ALGORITHMS; FUNCTIONS; ITERATIVE METHODS; VECTORS;

UNCONSTRAINED MINIMIZATION;

CONVERGENCE OF NUMERICAL METHODS;

EID: 0036539932     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014842520519     Document Type: Article

References (18)

1. Direct search methods on parallel machines
2. Nonlinear optimization toolbox
3. Convergence properties of the Nelder-Mead simplex algorithm in low dimensions
4. Convergence of the Nelder-Mead simplex method to a non-stationary point
5. Testing unconstrained optimization software
6. A simplex method for function minimization
7. An efficient method for finding the minimum of a function of several variables without calculating derivatives
8. Direct search algorithms for optimization calculations
9. Sequential application of simplex designs in optimisation and evolutionary operation
10. Fortified-descent simplicial search method: A general approach
11. Direct search methods: Once scorned, now respectable
12. Minimizing a function without calculating derivatives