One-dimensional Minimization
[Numerical Algorithms]

Classes
class	ROOT::Math::BrentMinimizer1D
class	ROOT::Math::GSLMinimizer1D
class	ROOT::Math::IMinimizer1D
class	ROOT::Math::BrentMinimizer1D
class	ROOT::Math::IMinimizer1D
class	ROOT::Math::GSLMinimizer1D
class	ROOT::Math::GSL1DMinimizerWrapper
Enumerations
enum	ROOT::Math::Minim1D::Type
enum	ROOT::Math::Minim1D::Type

---

Enumeration Type Documentation

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

Definition at line 56 of file GSLMinimizer1D.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

Definition at line 56 of file GSLMinimizer1D.h.

---