On the optimal parameter values of the Nelder-Mead simplex algorithm
From MaRDI portal
Cites work
- A convergent variant of the Nelder--Mead algorithm
- A modified Nelder-Mead barrier method for constrained optimization
- A Simplex Method for Function Minimization
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Convergence of the Nelder-Mead method
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence theorems for the Nelder-Mead method
- Derivative-free optimization methods
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- Effect of dimensionality on the Nelder–Mead simplex method
- Estimates of Location Based on Rank Tests
- Fortified-Descent Simplicial Search Method: A General Approach
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
- Grid restrained Nelder-Mead algorithm
- scientific article; zbMATH DE number 44982 (Why is no real title available?)
- scientific article; zbMATH DE number 3624650 (Why is no real title available?)
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 2078361 (Why is no real title available?)
- scientific article; zbMATH DE number 879773 (Why is no real title available?)
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- Nonparametric statistical methods
- Paramils: an automatic algorithm configuration framework
- Practical initialization of the Nelder-Mead method for computationally expensive optimization problems
- Proper initialization is crucial for the Nelder-Mead simplex search
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Simplex direct search algorithms
- The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization
- Unconstrained derivative-free optimization by successive approximation
This page was built for publication: On the optimal parameter values of the Nelder-Mead simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257126)