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:
“This is something that I cannot get over—that a whole line could be written by half a man, that a work could be built on the quicksand of a character.”
—Karl Kraus (1874–1936)
“So often has my judgment deceived me in my life, that I always suspect it, right or wrong,—at least I am seldom hot upon cold subjects. For all this, I reverence truth as much as any body; and ... if a man will but take me by the hand, and go quietly and search for it ... I’ll go to the world’s end with him:MBut I hate disputes.”
—Laurence Sterne (1713–1768)