The WolfeConditions class specifies conditions for inexact line search algorithms to acceptable/near minimal point along a given search direction p that exhibits (1) SDC: sufficient decrease (f(x) enough less that f(0)) and (2) CC: the slope at x is less steep than the slope at 0. That is, the line search looks for a value for x satisfying the two Wolfe conditions.
Perform an inexact Line Search (LS) on the function f to find an approximate local minima from the point x moving distance a (alpha) in the search direction p, which satisfies both Wolfe Conditions, returning the displacement a and the new point y = x + p * a.
Perform an inexact Line Search (LS) on the function f to find an approximate local minima from the point x moving distance a (alpha) in the search direction p, which satisfies both Wolfe Conditions, returning the displacement a and the new point y = x + p * a.