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.
Definition at line 40 of file MnLineSearch.h.
Public Member Functions | |
MnPoint | operator() (const MnFcn &, const MinimumParameters &, const MnAlgebraicVector &, double, const MnMachinePrecision &) const |
Perform a line search from position defined by the vector st along the direction step, where the length of vector step gives the expected position of Minimum. | |
#include <Minuit2/MnLineSearch.h>
MnPoint ROOT::Minuit2::MnLineSearch::operator() | ( | const MnFcn & | fcn, |
const MinimumParameters & | st, | ||
const MnAlgebraicVector & | step, | ||
double | gdel, | ||
const MnMachinePrecision & | prec ) const |
Perform a line search from position defined by the vector st along the direction step, where the length of vector step gives the expected position of Minimum.
fcn is Value of function at the starting position , gdel (if non-zero) is df/dx along step at st. Return a parabola point containing Minimum x position and y (function Value)
Definition at line 44 of file MnLineSearch.cxx.