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...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI AG
2024-11-01
|
| Serie: | Algorithms |
| Soggetti: | |
| Accesso online: | https://www.mdpi.com/1999-4893/17/11/523 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|