On descent from local minima
A. A. Goldstein, J. F. Price
Source record
Source: Crossref
Published: Jan 1, 1971
DOI: 10.1090/s0025-5718-1971-0312365-x
Open original source ↗Source abstract
When a local minimum of a function of several variables has been found by use of an algorithm for finding such minima numerically, one often runs the same algorithm many times with different starting values in the hopes of finding a lower minimum. Here, under the assumption that a local minimum is known, a process with analytical criteria is described which sometimes finds smaller local minima in an algorithmic manner.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.