- class POWELL(maxiter=None, maxfev=1000, disp=False, xtol=0.0001, tol=None, options=None, **kwargs)¶
The Powell algorithm performs unconstrained optimization; it ignores bounds or constraints. Powell is a conjugate direction method: it performs sequential one-dimensional minimization along each directional vector, which is updated at each iteration of the main minimization loop. The function being minimized need not be differentiable, and no derivatives are taken.
Uses scipy.optimize.minimize Powell. For further detail, please refer to See https://docs.scipy.org/doc/scipy/reference/generated/scipy.optimize.minimize.html
maxiter (int | None) – Maximum allowed number of iterations. If both maxiter and maxfev are set, minimization will stop at the first reached.
maxfev (int) – Maximum allowed number of function evaluations. If both maxiter and maxfev are set, minimization will stop at the first reached.
disp (bool) – Set to True to print convergence messages.
xtol (float) – Relative error in solution xopt acceptable for convergence.
tol (float | None) – Tolerance for termination.
options (dict | None) – A dictionary of solver options.
kwargs – additional kwargs for scipy.optimize.minimize.
Return support level dictionary
We compute the gradient with the numeric differentiation in the parallel way, around the point x_center.
Minimize the scalar function.
Print algorithm-specific options.
Set max evals grouped
Sets or updates values in the options dictionary.
Wrap the function to implicitly inject the args at the call of the function.
Returns bounds support level
Returns gradient support level
Returns initial point support level
Returns is bounds ignored
Returns is bounds required
Returns is bounds supported
Returns is gradient ignored
Returns is gradient required
Returns is gradient supported
Returns is initial point ignored
Returns is initial point required
Returns is initial point supported