Description

Implements a 1-dimensional minimization along a given direction (i.e. quadratic interpolation) It is independent of the algorithm that generates the direction vector. It brackets the 1-dimensional Minimum and iterates to approach the real Minimum of the n-dimensional function.

Author: Fred James and Matthias Winkler; comments added by Andras Zsenei and Lorenzo Moneta

Definition at line 47 of file MnLineSearch.h.

Public Member Functions
	MnLineSearch ()

	~MnLineSearch ()

MnParabolaPoint	operator() (const MnFcn &, const MinimumParameters &, const MnAlgebraicVector &, double, const MnMachinePrecision &, bool debug=false) const

Constructor & Destructor Documentation

◆ MnLineSearch()

ROOT::Minuit2::MnLineSearch::MnLineSearch ( )

inline

Definition at line 51 of file MnLineSearch.h.

51 {}

◆ ~MnLineSearch()

ROOT::Minuit2::MnLineSearch::~MnLineSearch ( )

inline

Definition at line 53 of file MnLineSearch.h.

53 {}

Member Function Documentation

◆ operator()()

MnParabolaPoint ROOT::Minuit2::MnLineSearch::operator()	(	const MnFcn &	,
		const MinimumParameters &	,
		const MnAlgebraicVector &	,
		double	,
		const MnMachinePrecision &	,
		bool	debug = `false`
	)		const

The documentation for this class was generated from the following file: