In the unconstrained minimization problem, the Wolfe conditions are a set of inequalities for performing inexact line search, especially in quasi-Newton methods.
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 .
Read more about Wolfe Conditions: Armijo Rule and Curvature, Strong Wolfe Condition On Curvature
Famous quotes containing the words wolfe and/or conditions:
“On Wall Street he and a few others—how many?—three hundred, four hundred, five hundred?—had become precisely that ... Masters of the Universe.”
—Tom Wolfe (b. 1931)
“It is part of the educator’s responsibility to see equally to two things: First, that the problem grows out of the conditions of the experience being had in the present, and that it is within the range of the capacity of students; and, secondly, that it is such that it arouses in the learner an active quest for information and for production of new ideas. The new facts and new ideas thus obtained become the ground for further experiences in which new problems are presented.”
—John Dewey (1859–1952)