pycutest.find_problems

pycutest.find_problems(objective=None, constraints=None, regular=None, degree=None, origin=None, internal=None, n=None, userN=None, m=None, userM=None)

Returns the problem names of problems that match the given requirements. The search is based on the CUTEst problem classification string (see http://www.cuter.rl.ac.uk/Problems/classification.shtml).

Problems with a user-settable number of variables/constraints match any given n / m.

Returns the problem names of problems that matched the given requirements.

If a requirement is not given, it is not applied. See below for details on the requirements.

Parameters:

  • objective – a string containing one or more substrings ('none', 'constant', 'linear', 'quadratic', 'sum of squares', 'other') specifying the type of the objective function

  • constraints – a string containing one or more substrings ('unconstrained', 'fixed', 'bound', 'adjacency', 'linear', 'quadratic', 'other') specifying the type of the constraints

  • regular – a boolean, True if the problem must be regular, False if it must be irregular

  • degree – list of the form [min, max] specifying the minimum and the maximum number of analytically available derivatives

  • origin – a string containing one or more substrings ('academic', 'modelling', 'real-world') specifying the origin of the problem

  • internal – a boolean, True if the problem must have internal variables, False if internal variables are not allowed

  • n – a list of the form [min, max] specifying the lowest and the highest allowed number of variables

  • userN – True if the problems must have user settable number of variables, False if the number must be hardcoded

  • m – a list of the form [min, max] specifying the lowest and the highest allowed number of constraints

  • userM – True of the problems must have user settable number of variables, False if the number must be hardcoded

Returns:

list of strings with problem names which satisfy the given requirements