Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 1234]

Teuchos::LabeledObject [external]
Teuchos::Describable [external]
GlobiPack::Brents1DMinimization< Scalar >	Simple concrete class that implements a 1D algorithm to mimimize a 1D function
GlobiPack::GoldenQuadInterpBracket< Scalar >	Simple concrete class that implements a 1D algorithm to bracket the minimum of a 1D merit function
GlobiPack::LineSearchBase< Scalar >	Base class for 1D linearsearch algorithms
GlobiPack::ArmijoPolyInterpLineSearch< Scalar >	Linesearch subclass implementing a backtracking-only line search using an Armijo cord test condition and a quadratic interploation
GlobiPack::BrentsLineSearch< Scalar >	Linesearch subclass implementing a function-value-only approximate minimization algorithm using bracketing and then Brent's 1D minimization method
GlobiPack::MeritFunc1DBase< Scalar >	Base class for 1D merit fucntions used in globalization methods
GlobiPack::TestLagrPolyMeritFunc1D< Scalar >	Lagrange Polynomial Merit Function used in testing
logic_error
GlobiPack::Exceptions::NotDescentDirection	Thrown if search direction not a descent direction for the merit function
Teuchos::ParameterListAcceptor [external]
GlobiPack::LineSearchBase< Scalar >	Base class for 1D linearsearch algorithms
Teuchos::ParameterListAcceptorDefaultBase [external]
GlobiPack::ArmijoPolyInterpLineSearch< Scalar >	Linesearch subclass implementing a backtracking-only line search using an Armijo cord test condition and a quadratic interploation
GlobiPack::Brents1DMinimization< Scalar >	Simple concrete class that implements a 1D algorithm to mimimize a 1D function
GlobiPack::BrentsLineSearch< Scalar >	Linesearch subclass implementing a function-value-only approximate minimization algorithm using bracketing and then Brent's 1D minimization method
GlobiPack::GoldenQuadInterpBracket< Scalar >	Simple concrete class that implements a 1D algorithm to bracket the minimum of a 1D merit function
GlobiPack::PointEval1D< Scalar >	Represents the evaluation point of the merit function phi(alpha) and/or is derivative Dphi(alpha)
Teuchos::VerboseObjectBase [external]
Teuchos::VerboseObject< Brents1DMinimization< Scalar > > [external]
GlobiPack::Brents1DMinimization< Scalar >	Simple concrete class that implements a 1D algorithm to mimimize a 1D function
Teuchos::VerboseObject< GoldenQuadInterpBracket< Scalar > > [external]
GlobiPack::GoldenQuadInterpBracket< Scalar >	Simple concrete class that implements a 1D algorithm to bracket the minimum of a 1D merit function
Teuchos::VerboseObject< LineSearchBase< Scalar > > [external]
GlobiPack::LineSearchBase< Scalar >	Base class for 1D linearsearch algorithms