This is an implementation of the Nelder-Mead method in (native) Java.

The Nelder–Mead method (also downhill simplex method, amoeba method, or polytope method) is a numerical method used to find the minimum or maximum of an objective function in a multidimensional space.

The implementation contains (for now):

1. The core logic of the method
2. A visualization module

The current implementation works (for now) for the following functions:

1. Himmelblau's function
2. Booth function