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...

Full description

Bibliographic Details

Published in:	IEEE Access
Main Authors:	Hassan A. Musafer, Ausif Mahmood
Format:	Article
Language:	English
Published:	IEEE 2018-01-01
Subjects:	Unconstrained optimization selective simplex Spendley-Hext-Himsworth algorithm Nelder-Mead algorithm downhill simplex algorithm
Online Access:	https://ieeexplore.ieee.org/document/8409931/