Improvement of the Nelder-Mead method using direct inversion in iterative subspace

DOI10.1007/s11081-021-09620-4zbMath1494.90130OpenAlexW3137692467MaRDI QIDQ2147934

Ken-ichi Amano, Haru Kitaoka, Tetsuo Sakka, Naoya Nishi

Publication date: 20 June 2022

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-021-09620-4

zbMATH Keywords

optimization algorithmsNelder-Mead simplexderivative-free search methodpulay mixingruntime distribution

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• Unnamed Item
• Unnamed Item
• On the optimal design of river fishways
• Implementing the Nelder-Mead simplex algorithm with adaptive parameters
• Proper initialization is crucial for the Nelder-Mead simplex search
• Convergence of the Restricted Nelder--Mead Algorithm in Two Dimensions
• Effect of dimensionality on the Nelder–Mead simplex method
• Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
• A Simplex Method for Function Minimization

This page was built for publication: Improvement of the Nelder-Mead method using direct inversion in iterative subspace