Convergence of the Nelder-Mead method
From MaRDI portal
Publication:2672718
DOI10.1007/S11075-021-01221-7zbMATH Open1495.65089OpenAlexW3212793018MaRDI QIDQ2672718FDOQ2672718
Authors: Aurél Galántai
Publication date: 13 June 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-021-01221-7
Recommendations
- Convergence theorems for the Nelder-Mead method
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- scientific article; zbMATH DE number 14314
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Simplex Method for Function Minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deeper Inside PageRank
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to Derivative-Free Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- The boundedness of all products of a pair of matrices is undecidable
- Title not available (Why is that?)
- Google's PageRank and beyond. The science of search engine rankings
- Title not available (Why is that?)
- Direct search methods: Then and now
- Title not available (Why is that?)
- Advanced topics in linear algebra. Weaving matrix problems through the Weyr Form
- Infinite powers of matrices and characteristic roots
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- Characterization and properties of matrices with \(k\)-involutory symmetries
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Nonhomogeneous matrix products
- Title not available (Why is that?)
- Effect of dimensionality on the Nelder–Mead simplex method
- 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
- On matrix norms and logarithmic norms
- Title not available (Why is that?)
- On the roots of certain polynomials arising from the analysis of the Nelder-Mead simplex method
- Nelder, Mead, and the other simplex method
- Title not available (Why is that?)
- Derivative-free and blackbox optimization
- Infinite products and paracontracting matrices
- Title not available (Why is that?)
- Convergence theorems for the Nelder-Mead method
Cited In (6)
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- A hyperbolic variant of the Nelder-Mead simplex method in low dimensions
- Convergence theorems for the Nelder-Mead method
- Effect of dimensionality on the Nelder–Mead simplex method
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- A convergent variant of the Nelder--Mead algorithm
Uses Software
This page was built for publication: Convergence of the Nelder-Mead method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672718)