Background The Nelder-Mead algorithm is used to find the smallest value of a function. The algorithm first evaluates the function at a set of points, called the simplex. Then the algorithm replaces the worst point with a new point generated via a geometric reflection of the worst point through the simplex. The most basic movement …