Global minimum / Local minimum

Statement

In optimization, a global minimum is the lowest value of a cost function over the entire domain; a local minimum is a point where the function is lower than at nearby points but not necessarily the lowest overall. Kirkpatrick, Gelatt, and Vecchi formalized these concepts in the context of simulated annealing for escaping local minima.

Formula

∇E(θ*) = 0

Source

Kirkpatrick, Gelatt, Vecchi, Optimization by Simulated Annealing, Science 1983.

Domains

mathematics, computer-science

People

Related

Explore

Canonical: https://axiom.tanaakk.com/theorem/global-minimum-local-minimum/