Derivative-free optimization test functions by More and Wild. (PyOPUS subsystem name: MWBM)
All 22 basic test functions [mw] in this module are maps from to . All functions are unconstrained. Every function comes from the CUTEr test set and is specified by a tuple (mgh_name, n, m, s), where n is the dimension, m is the number of component functions, and s specified the initial point scaling, i.e.
Every problem can be smooth, piecewise-smooth, deterministically noisy or stochastically noisy.
The CUTEr problems used by this suite are implemented in the _mwbm module. This module does not depend on CUTEr.
This module is independent of PyOPUS, meaning that it can be taken as is and used as a module in some other package. It depends only on the cpi and the _mwbm modules.
Beside test functions this module also includes support for data profile generation from function value history.
[mw] | More, J.J., Wild S.M., Benchmarking Derivative-Free Optimization Algorithms. SIAM Journal on Optimization, vol. 20, pp.172-191, 2009. |
Test functions from the More-Wild suite.
num is the problem number (0-52).
problemType is the type of the problem (0=smooth, 1=piecewise smooth, 2=deterministically noisy, 3=stochastically noisy).
epsilon is the noise level for problemType 2 and 3.
The number of the underlying function (0-21) is stored in probNdx. The dimension, the number of component functions, and the initial point scaling are stored in the n, m, and s members.
The full name of the problem is in the name member. It is of the form name_m_s.
The initial point can be obtained from the initial member. The function value is returned by the f() method.
The gradient and the best known minimum of the function are not available.
Returns the common problem interface.
xmin, fmin, and g are not available.
The info member of the returned dictionary is itself a dictionary with the following members:
- m - m parameter of the MWBM problem
- s - s parameter of the MWBM problem
See the CPI class for more information.
Problem descriptors (problem number, n, m, s)
List of problem names