Implementing the Nelder-Mead simplex algorithm with adaptive parameters

  title={Implementing the Nelder-Mead simplex algorithm with adaptive parameters},
  author={F. Gao and Lixing Han},
  journal={Computational Optimization and Applications},
  • F. Gao, Lixing Han
  • Published 2012
  • Computer Science, Mathematics
  • Computational Optimization and Applications
  • In this paper, we first prove that the expansion and contraction steps of the Nelder-Mead simplex algorithm possess a descent property when the objective function is uniformly convex. This property provides some new insights on why the standard Nelder-Mead algorithm becomes inefficient in high dimensions. We then propose an implementation of the Nelder-Mead method in which the expansion, contraction, and shrink parameters depend on the dimension of the optimization problem. Our numerical… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Comparative Study of Derivative Free Optimization Algorithms
    • 35
    • PDF
    Improved nelder mead's simplex method and applications
    • 24
    • PDF
    Evolving a Nelder–Mead Algorithm for Optimization with Genetic Programming
    • 12
    • Highly Influenced
    • PDF


    Publications referenced by this paper.
    A Simplex Method for Function Minimization
    • 23,067
    • PDF
    Convergence of the Nelder-Mead Simplex Method to a Nonstationary Point
    • 407
    • PDF
    Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
    • 1,437
    • PDF
    Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
    • 208
    • PDF
    Iterative methods for optimization
    • 1,694
    • PDF
    Optimization on Microcomputers: The Nelder-Mead Simplex Algorithm
    • 113
    • PDF
    A Convergent Variant of the Nelder–Mead Algorithm
    • 112
    • PDF
    • 940
    • PDF
    Effect of dimensionality on the Nelder–Mead simplex method
    • 71