In optimization, the line search strategy is one of two basic iterative approaches to finding a local minimum of an objective function . The other approach is trust region.
The line search approach first finds a descent direction along which the objective function will be reduced and then computes a step size that decides how far should move along that direction. The descent direction can be computed by various methods, such as gradient descent, Newton's method and Quasi-Newton method. The step size can be determined either exactly or inexactly.
Read more about Line Search: Example Use
Famous quotes containing the words line and/or search:
“I said: “A line will take us hours maybe;
Yet if it does not seem a moment’s thought,
Our stitching and unstitching has been naught.”
—William Butler Yeats (1865–1939)
“Gaily bedight,
A gallant knight,
In sunshine and in shadow,
Had journeyed long,
Singing a song,
In search of Eldorado.”
—Edgar Allan Poe (1809–1849)