The function to be minimised
The lower bound of the interval to search in
The upper bound of the interval to search in
Control parameters for the optimisation
The maximum number of iterations of the
algorithm (calls to Brent.step()
) to
take. Because the algorithm is guaranteed to converge, a value of
Infinity
is safe, and is the default.
Has the algorithm converged?
Any additional data returned by the target function, for this point
The number of times that target
has been called so far
The number of times that step has been called so far
The best found location
The value of target(location)
Generated using TypeDoc
Run the Brent 1d minimisation on a target function. This is a convenience function and offers little control but a compact interface. For more control, use Brent directly.
Returns
See
Brent.result
for details