44 #ifndef GLOBIPACK_BRENTS_LINE_SEARCH_DECL_HPP 45 #define GLOBIPACK_BRENTS_LINE_SEARCH_DECL_HPP 49 #include "GlobiPack_GoldenQuadInterpBracket.hpp" 50 #include "GlobiPack_Brents1DMinimization.hpp" 72 template<
typename Scalar>
137 template<
typename Scalar>
147 namespace BrentsLineSearchUtils {
162 #endif // GLOBIPACK_BRENTS_LINE_SEARCH_DECL_HPP GoldenQuadInterpBracket< Scalar > bracket_
const Brents1DMinimization< Scalar > & brentsMin() const
For unit testing only .
void setParameterList(RCP< ParameterList > const ¶mList)
Simple concrete class that implements a 1D algorithm to mimimize a 1D function.
Simple concrete class that implements a 1D algorithm to bracket the minimum of a 1D merit function...
const RCP< BrentsLineSearch< Scalar > > brentsLineSearch()
Nonmember constructor.
Brents1DMinimization< Scalar > brentsMin_
const GoldenQuadInterpBracket< Scalar > & bracket() const
For unit testing only .
virtual bool requiresDerivEvals() const
Returns false.
RCP< const ParameterList > getValidParameters() const
Represents the evaluation point of the merit function phi(alpha) and/or is derivative Dphi(alpha)...
TEUCHOS_DEPRECATED RCP< T > rcp(T *p, Dealloc_T dealloc, bool owns_mem)
Base class for 1D linearsearch algorithms.
virtual bool requiresBaseDeriv() const
Returns true.
Linesearch subclass implementing a function-value-only approximate minimization algorithm using brack...
const std::string minimize_name
Base class for 1D merit fucntions used in globalization methods.
const std::string bracket_name
virtual bool doLineSearch(const MeritFunc1DBase< Scalar > &phi, const PointEval1D< Scalar > &point_k, const Ptr< PointEval1D< Scalar > > &point_kp1, const Ptr< int > &numIters) const
BrentsLineSearch()
Construct with default parameters.