Sphere function of two variables

Contour

In mathematical optimization, the sphere function is a convex function used as a performance test problem for optimization algorithms. The sphere function was proposed by Kenneth A. De Jong in 1975 as the first item of a series of computational test sets.^[1] Because of this, the sphere function is also collectively referred to as De Jong's function or De Jong's first function.^[2]

On a ${\displaystyle n}$-dimensional domain it is defined by $${\displaystyle f((x_{1},x_{2},\dots ,x_{n}))=\sum _{i=1}^{n}x_{i}^{2}.}$$

The function is typically evaluated on the domain ${\displaystyle x_{i}\in [-5.12,5.12]}$ for all ${\displaystyle 1\leq i\leq n}$.^[2]

It has a global minimum of zero at ${\displaystyle x_{i}=0.}$ It is a separable function; that is, it can be expressed as a product of functions in one variable.^[3]

The sphere function is used as a benchmark problem to measure algorithms' precision, convergence rate, and robustness, specifically over how well the algorithm handles the function's smooth nature. Several variants of the sphere function are also used, including the Rastrigin function.^[2][4]

• Test functions for optimization

This applied mathematics–related article is a stub. You can help Wikipedia by adding missing information.

• v
• t
• e