Multi-direction-based Nelder-Mead method
From MaRDI portal
Publication:5495571
DOI10.1080/02331934.2012.698619zbMATH Open1309.90051OpenAlexW2322198382MaRDI QIDQ5495571FDOQ5495571
Authors: 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
Recommendations
- The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization
- A modified simplex method
- Less is more: simplified Nelder-Mead method for large unconstrained optimization
- Modified and restarted Nelder-Mead algorithm for unconstrained optimization. I: Theoretical analysis
- A restarted and modified simplex search for unconstrained optimization
Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- A Simplex Method for Function Minimization
- Effect of dimensionality on the Nelder–Mead simplex method
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- A convergent variant of the Nelder--Mead algorithm
- Grid restrained Nelder-Mead algorithm
- A parallel implementation of the simplex function minimization routine
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
Cited In (3)
This page was built for publication: Multi-direction-based Nelder-Mead method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495571)
