Lesson plan

Griewank function

In mathematics, the Griewank test function is a smooth multidimensional mathematical function used in unconstrained optimization. It is commonly employed to evaluate the performance of global optimization algorithms. The function is defined as : f(x) = 1 + \frac{1}{4000}\sum_{i=1}^n x_i^2 - \prod_{i=1}^n P_i(x_i), where x = (x_1,\dots,x_n) \in \R^n and P_i(x_i)=\cos(x_i/\sqrt{i}) . The non-linear and non-convex function is characterized by its unique multimodal structure, featuring multiple local minima and maxima around its single global minimum at x^\ast = 0 , where the function has minimal value f(x^\ast) = 0 . The number of stationary points increases as the dimensionality n grows. For instance, the one-dimensional Griewank function f(x_1) = 1+(1/4000)\cdot x_1^2-\cos(x_1) has 6365 critical points in the interval [-10000,10000] , where the first derivative vanishes. These points satisfy the equation : \nabla f(x_1) = \frac{1}{2000} \cdot x_1 + \sin(x_1) = 0 . The multimodal structure of the Griewank function presents a challenge for many deterministic optimization algorithms, which may become trapped in one of the numerous local minima. This is particularly problematic for gradient-based methods. The Griewank function is commonly used to benchmark global optimization algorithms, such as genetic algorithms or particle swarm optimization.…

Back to article

Article summary

In mathematics, the Griewank test function is a smooth multidimensional mathematical function used in unconstrained optimization. It is commonly employed to evaluate the performance of global optimization algorithms. The function is defined as : f(x) = 1 + \frac{1}{4000}\sum_{i=1}^n x_i^2 - \prod_{i=1}^n P_i(x_i), where x = (x_1,\dots,x_n) \in \R^n and P_i(x_i)=\cos(x_i/\sqrt{i}) . The non-linear and non-convex function is characterized by its unique multimodal structure, featuring multiple local minima and maxima around its single global minimum at x^\ast = 0 , where the function has minimal value f(x^\ast) = 0 . The number of stationary points increases as the dimensionality n grows. For instance, the one-dimensional Griewank function f(x_1) = 1+(1/4000)\cdot x_1^2-\cos(x_1) has 6365 critical points in the interval [-10000,10000] , where the first derivative vanishes. These points satisfy the equation : \nabla f(x_1) = \frac{1}{2000} \cdot x_1 + \sin(x_1) = 0 . The multimodal structure of the Griewank function presents a challenge for many deterministic optimization algorithms, which may become trapped in one of the numerous local minima. This is particularly problematic for gradient-based methods. The Griewank function is commonly used to benchmark global optimization algorithms, such as genetic algorithms or particle swarm optimization.…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.