Line-Search algorithm
Perform 1D line-search analysis to determine optimum step length.
Contains the follwing functionallity
- Bracket local minimum i.e., determine upper and lower bounds of step-size
- Golden Sections, determine optimum step-size within upper and lower bounds
- Steady increase, determine optimum step-size within upper and lower bounds using the Strong Wolfe conditions
- Backtracking, determine step-size based on back-tracking approach using the Armijo-Goldstein condition