One-dimensional Minimization
[Numerical Algorithms]

Collaboration diagram for One-dimensional Minimization:

Classes
class	ROOT::Math::GSLSimAnMinimizer
	GSLSimAnMinimizer class for minimization using simulated annealing using the algorithm from GSL. More...
class	ROOT::Math::Minimizer1D
	Minimizer for arbitrary one dimensional functions. More...
class	ROOT::Math::GSL1DMinimizer
	wrapper class for gsl_min_fminimizer structure More...
Enumerations
enum	ROOT::Math::EGSLMinimizerType {   ROOT::Math::kConjugateFR, ROOT::Math::kConjugatePR, ROOT::Math::kVectorBFGS, ROOT::Math::kVectorBFGS2,   ROOT::Math::kSteepestDescent }
	enumeration specifying the types of GSL minimizers More...
enum	ROOT::Math::Minim1D::Type { ROOT::Math::Minim1D::GOLDENSECTION, ROOT::Math::Minim1D::BRENT }
	Enumeration with One Dimensional Minimizer Algorithms. More...

---

Enumeration Type Documentation

enum ROOT::Math::EGSLMinimizerType

enumeration specifying the types of GSL minimizers

Enumerator:

kConjugateFR
kConjugatePR
kVectorBFGS
kVectorBFGS2
kSteepestDescent

Definition at line 67 of file GSLMinimizer.h.

enum ROOT::Math::Minim1D::Type

Enumeration with One Dimensional Minimizer Algorithms.

The algorithms are implemented using GSL, see the GSL manual.

The algorithms available are:

• Golden Section Algorithm, simplest method of bracketing the minimum of a function
• Brent Algorithm, which combines a parabolic interpolation with the golden section algorithm

Enumerator:

GOLDENSECTION
BRENT

Definition at line 61 of file Minimizer1D.h.

---