Dynamic Hassan Nelder Mead with Simplex Free Selectivity for Unconstrained Optimization
We propose a free selective simplex for the downhill Nelder Mead simplex algorithm (1965), rather than the determinant simplex that forces its elements to perform a single operation, such as reflection. Unlike the Nelder-Mead algorithm, the elements of the proposed simplex select various operations...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2018-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8409931/ |