The function to be minimised
The initial location to start the search from
Control parameters, as an object
The maximum number of iterations, per
dimension, of the algorithm (calls to Simplex.step()
) to take. For example, if you pass maxIterations
of 200 and are solving a problem where location.length
is 5,
you'll take a maximum of 1000 steps in total. If we converge before
hitting this number we will return early.
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 Simplex algorithm on a target function. This is a convenience function and offers little control but a compact interface. For more control, use Simplex directly.
Returns
See
Simplex.result
for details