On-line simplex search

Versione 1.0.0 (30,5 KB) da Gert Kruger
A reentrant version of the well-known Simplex search (Nelder-Mead) optimization is provided.
0.0
(0)
54 download
Aggiornato 28 mag 2019

Visualizza la licenza

The on-line simplex search is an implementation of the well known Nelder-Mead optimization algorithm. The usual simplex search found in Matlab is not appropriate for an on-line implementation, because the state variables used are not persistent and the algorithm is not implemented to be reentrant. The implementation provided here is reentrant.
Thus, a sample vertex generated by the algorithm can be put out and be evaluated. After the system has settled to the evaluated vertex a new cost value can be read, after which the function can be reentered with the costs of previous vertices "remembered" due to persistent variables.

Cita come

Gert Kruger (2024). On-line simplex search (https://www.mathworks.com/matlabcentral/fileexchange/71673-on-line-simplex-search), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2010a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versione Pubblicato Note della release
1.0.0