Computational methods simplex code

Among the methods presented above, we have chosen the best implemented in computer codes (algorithms for 2D and 3D morphology) available at http // www.ichf.edu.pl/mfialkowski/morph.html. The 3D program uses the tetragonal simplex decomposition (Section III.B) with a consequent triangulation scheme... 

Nelder and Mead (1965) described a more efficient (but more complex) version of the simplex method that permitted the geometric figures to expand and contract continuously during the search. Their method minimized a function of n variables using (n + 1) vertices of a flexible polyhedron. Details of the method together with a computer code to execute the algorithm can be found in Avriel (1976). 

---