The Nelder–Mead Simplex Algorithm Is Sixty Years Old: New Convergence Results and Open Questions
We investigate and compare two versions of the Nelder–Mead simplex algorithm for function minimization. Two types of convergence are studied: the convergence of function values at the simplex vertices and convergence of the simplex sequence. For the first type of convergence, we generalize the main...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
MDPI AG
2024-11-01
|
| Schriftenreihe: | Algorithms |
| Schlagworte: | |
| Online-Zugang: | https://www.mdpi.com/1999-4893/17/11/523 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|