In these methods the idea is to find
for some smooth . Each step often involves approximately solving the subproblem
where is the current best guess, is a search direction, and is the step length.
Then inexact line searches provide an efficient way of computing an acceptable step length that reduces the objective function 'sufficiently', rather than minimizing the objective function over exactly. A line search algorithm can use Wolfe conditions as a requirement for any guessed, before finding a new search direction .
Other articles related to "wolfe conditions, condition":
... The Wolfe conditions, however, can result in a value for the step length that is not close to a minimizer of ... If we modify the curvature condition to the following, iia) then i) and iia) together form the so-called strong Wolfe conditions, and force to lie close to a critical point of ... The principal reason for imposing the Wolfe conditions in an optimization algorithm where is to ensure convergence of the gradient to zero ...
Famous quotes containing the words conditions and/or wolfe:
“Brutus had rather be a villager
Than to repute himself a son of Rome
Under these hard conditions as this time
Is like to lay upon us.”
—William Shakespeare (15641616)
“But he lay like a warrior taking his rest
With his martial cloak around him.”
—Charles Wolfe (17911823)