_minimize_powell(func, x0, args=(), callback=None, bounds=None, xtol=0.0001, ftol=0.0001, maxiter=None, maxfev=None, disp=False, direc=None, return_all=False, **unknown_options)
Set to True to print convergence messages.
Relative error in solution :None:None:`xopt` acceptable for convergence.
Relative error in fun(xopt)
acceptable for convergence.
Maximum allowed number of iterations and function evaluations. Will default to N*1000
, where N
is the number of variables, if neither :None:None:`maxiter` or :None:None:`maxfev` is set. If both :None:None:`maxiter` and :None:None:`maxfev` are set, minimization will stop at the first reached.
Initial set of direction vectors for the Powell method.
Set to True to return a list of the best solution at each of the iterations.
If bounds are not provided, then an unbounded line search will be used. If bounds are provided and the initial guess is within the bounds, then every function evaluation throughout the minimization procedure will be within the bounds. If bounds are provided, the initial guess is outside the bounds, and :None:None:`direc` is full rank (or left to default), then some function evaluations during the first iteration may be outside the bounds, but every function evaluation after the first iteration will be within the bounds. If :None:None:`direc` is not full rank, then some parameters may not be optimized and the solution is not guaranteed to be within the bounds.
Set to True to return a list of the best solution at each of the iterations.
Minimization of scalar function of one or more variables using the modified Powell algorithm.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them