DIRECT_L¶
- class DIRECT_L(max_evals=1000)[source]¶
DIviding RECTangles Locally-biased optimizer.
DIviding RECTangles (DIRECT) is a deterministic-search algorithms based on systematic division of the search domain into increasingly smaller hyper-rectangles. The DIRECT-L version is a “locally biased” variant of DIRECT that makes the algorithm more biased towards local search, so that it is more efficient for functions with few local minima.
NLopt global optimizer, derivative-free. For further detail, please refer to http://nlopt.readthedocs.io/en/latest/NLopt_Algorithms/#direct-and-direct-l
- Parameters
max_evals (
int
) – Maximum allowed number of function evaluations.- Raises
NameError – NLopt library not installed.
Attributes
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
Return setting
Methods
Return NLopt optimizer type
return support level dictionary
DIRECT_L.gradient_num_diff
(x_center, f, epsilon)We compute the gradient with the numeric differentiation in the parallel way, around the point x_center.
DIRECT_L.optimize
(num_vars, objective_function)Perform optimization.
Print algorithm-specific options.
Set max evals grouped
DIRECT_L.set_options
(**kwargs)Sets or updates values in the options dictionary.
DIRECT_L.wrap_function
(function, args)Wrap the function to implicitly inject the args at the call of the function.