Uses of Package
pulse.search.linear

Packages that use pulse.search.linear

Package	Description
pulse.search.direction	Provides a list of PathSolvers and associated classes, which are used to determine the direction of the minimum of a specific SearchTask using an iterative approach.
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.

Classes in pulse.search.linear used by pulse.search.direction

Class	Description
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.

Classes in pulse.search.linear used by pulse.search.linear

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.