Ackley Function
   HOME

TheInfoList



OR:

In
mathematical optimization Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criteria, from some set of available alternatives. It is generally divided into two subfiel ...
, the Ackley function is a non-
convex function In mathematics, a real-valued function is called convex if the line segment between any two distinct points on the graph of a function, graph of the function lies above or on the graph between the two points. Equivalently, a function is conve ...
used as a performance test problem for optimization algorithms. It was proposed by David Ackley in his 1987 PhD dissertation. The function is commonly used as a minimization function with global minimum value 0 at 0,.., 0 in the form due to Thomas Bäck. While Ackley gives the function as an example of "fine-textured broadly unimodal space" his thesis does not actually use the function as a test. For d dimensions, is defined as : f(x) = -a \exp \left( -b \sqrt \right) - \exp \left( \frac \sum_{i=1}^d \cos(c x_i) \right) + a + \exp(1) Recommended variable values are a = 20, b = 0.2, and c = 2\pi. The global minimum is f(x^*) = 0 at x^* = 0.


See also

* Test functions for optimization


Notes

Test functions for optimization