Downhill simplex

Downhill simplex is a numerical method for solving many-dimensional problems. It belongs to the more general class of search algorithms.

An example can be found in Numerical Recipes in C, Press et al.