The code in this Google project implements two optimization algorithms, Nelder and Mead Simplex and Levenberg-Marquardt derivative based optimizer. A common use for these optimizers is to solve least square curve fitting problems, that is given a set of data points, we wish to optimize a set of parameters associated with a proposed model curve so that we minimize the sum of squares of the difference between the data and the curve.