An algorithm is a line search method if it seeks the minimum of a defined nonlinear function by selecting a reasonable direction vector that, when computed iteratively with a reasonable step size, will provide a function value closer to the absolute minimum of the function. Varying these will change the "tightness" of the optimization. For example, given the function , an initial is chosen. To find a lower value of , the value of is increased by the following iteration scheme

Last modified

• 11/30/2018

Creator

• Elizabeth Conger

DOI

• https://doi.org/10.21985/N2ZF3T

Keyword

• Line Search Methods

Rights statement

• In Copyright