Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points

DOI10.1080/0305215X.2019.1688315OpenAlexW2990729522WikidataQ126652966 ScholiaQ126652966MaRDI QIDQ5059449

V. K. Mehta

Publication date: 23 December 2022

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

Full work available at URL: https://doi.org/10.1080/0305215x.2019.1688315

zbMATH Keywords

convergencehigh-dimensional problemsNelder-Mead algorithmadaptive parametersChebyshev spacing points

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Uses Software

• minpack

Cites Work

• Unnamed Item
• Implementing the Nelder-Mead simplex algorithm with adaptive parameters
• A convergent variant of the Nelder--Mead algorithm
• Grid restrained Nelder-Mead algorithm
• Unconstrained derivative-free optimization by successive approximation
• Nelder, Mead, and the other simplex method
• The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization
• Effect of dimensionality on the Nelder–Mead simplex method
• Testing Unconstrained Optimization Software
• Direct Search Methods on Parallel Machines
• 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
• Fortified-Descent Simplicial Search Method: A General Approach
• Benchmarking Derivative-Free Optimization Algorithms
• A Simplex Method for Function Minimization

This page was built for publication: Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points