A hyperbolic variant of the Nelder-Mead simplex method in low dimensions
DOI10.2478/ausm-2014-0012zbMath1296.65090OpenAlexW2042548452MaRDI QIDQ399493
Publication date: 19 August 2014
Published in: Acta Universitatis Sapientiae. Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/ausm-2014-0012
algorithmconvergencehyperbolic geometryNelder-Mead simplex methodBlaschke functionsBolyai-Lobachevsky geometryPoincaré disk model
Numerical mathematical programming methods (65K05) Hyperbolic and elliptic geometries (general) and generalizations (51M10) Nonlinear programming (90C30) Conformal metrics (hyperbolic, Poincaré, distance functions) (30F45)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A convergent variant of the Nelder--Mead algorithm
- On the roots of certain polynomials arising from the analysis of the Nelder-Mead simplex method
- Nelder, Mead, and the other simplex method
- Convergence of the Restricted Nelder--Mead Algorithm in Two Dimensions
- Effect of dimensionality on the Nelder–Mead simplex method
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- A Simplex Method for Function Minimization
This page was built for publication: A hyperbolic variant of the Nelder-Mead simplex method in low dimensions