Ackley function

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Multiple image

In mathematical optimization, the Ackley function is a non-convex function used as a performance test problem for optimization algorithms. It was proposed by David Ackley in his 1987 PhD dissertation.[1] 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.


On an d-dimensional domain it is defined as:[2]

f(𝐱)=−aexp⁡(−b1d∑i=1dxi2)

−exp⁡(1d∑i=1dcos⁡(cxi))+a+exp⁡(1)

Recommended variable values are a=20, b=0.2, and c=2π.

The global minimum is f(𝐱∗)=0 at 𝐱∗=𝟎.

See also

Notes

  1. ↑ Ackley, D. H. (1987) "A connectionist machine for genetic hillclimbing", Kluwer Academic Publishers, Boston MA. p. 13-14
  2. ↑ Template:Cite web