public static LineExtremum FindMinimum(
	Func<double, double> f,
	double x
)

Public Shared Function FindMinimum ( _
	f As Func(Of Double, Double), _
	x As Double _
) As LineExtremum

public:
static LineExtremum^ FindMinimum(
	Func<double, double>^ f, 
	double x
)

static member FindMinimum : 
        f : Func<float, float> * 
        x : float -> LineExtremum 

Return Value

Since the search algorithm begins by evaluating f near x, it can fail if x is near a singularity or other point at which the evaluation of f could fail. If you can reliably bracket a minimum, the other overload of this method is safer and, if your bracket is any good, slightly faster.