Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points
From MaRDI portal
Publication:5059449
Recommendations
- The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization
- Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- Sparse adaptive approximation of high dimensional parametric initial value problems
- scientific article; zbMATH DE number 7202316
- Spatially adaptive sparse grids for high-dimensional data-driven problems
- Adaptive-sparse polynomial dimensional decomposition methods for high-dimensional stochastic computing
- Adaptive bivariate Chebyshev approximation
- A hyperbolic variant of the Nelder-Mead simplex method in low dimensions
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
Cites work
- A convergent variant of the Nelder--Mead algorithm
- A Simplex Method for Function Minimization
- Benchmarking Derivative-Free Optimization Algorithms
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- Direct Search Methods on Parallel Machines
- Effect of dimensionality on the Nelder–Mead simplex method
- Fortified-Descent Simplicial Search Method: A General Approach
- Grid restrained Nelder-Mead algorithm
- scientific article; zbMATH DE number 879773 (Why is no real title available?)
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- Nelder, Mead, and the other simplex method
- Testing Unconstrained Optimization Software
- The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization
- Unconstrained derivative-free optimization by successive approximation
Cited in
(4)- The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- Parameter sensitivity study of the Nelder-Mead simplex method
- On the optimal parameter values of the Nelder-Mead simplex algorithm
This page was built for publication: Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059449)