Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search

DOI10.1023/A:1014842520519zbMath1007.90062OpenAlexW1512858435MaRDI QIDQ1610317

Paul Tseng, Larry Nazareth

Publication date: 19 August 2002

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014842520519

zbMATH Keywords

unconstrained minimizationNelder-Mead algorithmgolden-section direct search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (9)

Mesh-based Nelder-Mead algorithm for inequality constrained optimization ⋮ Survey of derivative-free optimization ⋮ A restarted and modified simplex search for unconstrained optimization ⋮ A hybrid simplex search and particle swarm optimization for unconstrained optimization ⋮ A derivative-free algorithm for spherically constrained optimization ⋮ A modified Nelder-Mead barrier method for constrained optimization ⋮ Derivative-free optimization methods ⋮ Less is more: Simplified Nelder-Mead method for large unconstrained optimization ⋮ Multi-direction-based Nelder–Mead method

Uses Software

• fminsearch

This page was built for publication: Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search