Recommendations
- A convergent variant of the Nelder--Mead algorithm
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- Efficient Implementation of the Nelder-Mead Search Algorithm
- CNM -- a convergent method of Nelder and Mead type.
Cites work
- A convergent variant of the Nelder--Mead algorithm
- A Simplex Method for Function Minimization
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- Direct search methods: Then and now
- Fortified-Descent Simplicial Search Method: A General Approach
- Frame based methods for unconstrained optimization
- scientific article; zbMATH DE number 3889289 (Why is no real title available?)
- scientific article; zbMATH DE number 879773 (Why is no real title available?)
- On the convergence of grid-based methods for unconstrained optimization
- On the Convergence of Pattern Search Algorithms
- Testing Unconstrained Optimization Software
- Theory of Positive Linear Dependence
Cited in
(17)- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- Mesh adaptive direct search with simplicial Hessian update
- Increasing the efficiency of selected grid search procedures through the introduction of a best step mechanism
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- CNM -- a convergent method of Nelder and Mead type.
- A simplex-based numerical framework for simple and efficient robust design optimization
- CARTopt: a random search method for nonsmooth unconstrained optimization
- Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points
- Black-Box Optimization: Methods and Applications
- Derivative-free optimization methods
- Multi-direction-based Nelder-Mead method
- A convergent variant of the Nelder--Mead algorithm
- Conjugate grids for unconstrained optimisation
- On the optimal parameter values of the Nelder-Mead simplex algorithm
- A restarted and modified simplex search for unconstrained optimization
- Mesh adaptive direct search with second directional derivative-based Hessian update
- Unconstrained derivative-free optimization by successive approximation
This page was built for publication: Grid restrained Nelder-Mead algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853559)
