Uses of Class
pulse.search.linear.LinearOptimiser

Packages that use LinearOptimiser

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.

Uses of LinearOptimiser in pulse.search.direction

Methods in pulse.search.direction that return LinearOptimiser

Modifier and Type	Method	Description
LinearOptimiser	CompositePathOptimiser.getLinearSolver()

Methods in pulse.search.direction that return types with arguments of type LinearOptimiser

Modifier and Type	Method	Description
InstanceDescriptor<? extends LinearOptimiser>	CompositePathOptimiser.getLinearOptimiserDescriptor()

Methods in pulse.search.direction with parameters of type LinearOptimiser

Modifier and Type	Method	Description
void	CompositePathOptimiser.setLinearSolver(LinearOptimiser linearSearch)	Assigns a LinearSolver to this PathSolver and sets this object as its parent.

Uses of LinearOptimiser in pulse.search.linear

Subclasses of LinearOptimiser in pulse.search.linear

Modifier and Type	Class	Description
class	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.
class	WolfeOptimiser	This is the implementation of the strong Wolfe conditions for performing inexact linear search.