Package pulse.search.linear

Provides classes that are able to search for the minimum of a scalar function of a vector variable that is unimodal on a specific Segment. These should be subclasses of LinearSolver.

Class Summary

Class	Description
GoldenSectionOptimiser	The golden-section search is a simple dichotomy search for finding the minimum of strictly unimodal functions by successively narrowing the domain of the search using the golden ratio partitioning.
LinearOptimiser	The most basic LinearSolver class, which defines the notion of the linear resolution, defines the method signature for estimating the step of the linear search (i.e., the position of the minimum), and provides a simple algorithm to initialise the calculation domain.
WolfeOptimiser	This is the implementation of the strong Wolfe conditions for performing inexact linear search.