Multi-direction-based Nelder-Mead method
From MaRDI portal
Publication:5495571
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
Cites work
- A Simplex Method for Function Minimization
- A convergent variant of the Nelder--Mead algorithm
- A parallel implementation of the simplex function minimization routine
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Effect of dimensionality on the Nelder–Mead simplex method
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
- Grid restrained Nelder-Mead algorithm
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)