Multi-direction-based Nelder–Mead method

DOI10.1080/02331934.2012.698619zbMath1309.90051OpenAlexW2322198382MaRDI QIDQ5495571

Hongfeng Xiao, Jian Duan

Publication date: 5 August 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2012.698619

zbMATH Keywords

random searchNelder-Mead methodlarge-scale global optimizationmulti-direction search

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Derivative-free methods and methods using generalized derivatives (90C56) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A convergent variant of the Nelder--Mead algorithm
• Grid restrained Nelder-Mead algorithm
• Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
• A parallel implementation of the simplex function minimization routine
• Effect of dimensionality on the Nelder–Mead simplex method
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
• A Simplex Method for Function Minimization

This page was built for publication: Multi-direction-based Nelder–Mead method