Improvement of the Nelder-Mead method using direct inversion in iterative subspace
From MaRDI portal
Recommendations
- Acceleration of the subspace iteration method by selective repeated inverse iteration
- Acceleration of the subspace iteration method by selective repeated inverse iteration
- Acceleration of inverse subspace iteration with Newton's method
- An iterative method and its application to stable inversion
- Direct and iteration methods for solving inverse and ill-posed problems
- Multi-direction-based Nelder-Mead method
- An iterative method for the inverse Dirichlet problem
- scientific article; zbMATH DE number 1262546
- scientific article; zbMATH DE number 5989744
- Improving the convergence rate of the inverse iteration method
Cites work
- A Simplex Method for Function Minimization
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- Effect of dimensionality on the Nelder–Mead simplex method
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- On the optimal design of river fishways
- Proper initialization is crucial for the Nelder-Mead simplex search
This page was built for publication: Improvement of the Nelder-Mead method using direct inversion in iterative subspace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147934)
