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

[detail level 1234]

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