The LineSearch trait specifies the basic methods for Line Search (LS) algorithms in classes extending this trait to implement. Line search is for one dimensional optimization problems. The algorithms perform line search to find an 'x'-value that minimizes a function 'f' that is passed into an implementing class.
Perform Line Search (LS) using a line search algorithm over the interval [x1, xmax]. Note, some line search implementations allow for expansion of the search interval.
Perform Line Search (LS) using a line search algorithm over the interval [x1, xmax]. Note, some line search implementations allow for expansion of the search interval.
Value parameters
x1
the left (smallest) anchor point for the search (usually 0)
xmax
a rough guess for the right end-point of the line search