Problem classes

class autolyap.problemclass.InclusionProblem(
components: List[_InterpolationCondition | List[_InterpolationCondition]],
)[source]

Bases: object

Representation of an inclusion problem defined by interpolation conditions.

See 2. Problem classes for notation and component conventions.

Parameters

  • components (list): A list of components indexed by \(\llbracket 1, m\rrbracket\), where \(m = \text{len(components)}\). Entry components[i-1] defines component \(i\). Each entry is either one interpolation-condition instance or a list of such instances. All conditions for a given component must be of the same type (all operator conditions or all function conditions). Condition classes are documented in Function classes and Operator classes.

Raises

  • ValueError: If components is empty or if any entry contains invalid conditions.

Note

  • For GradientDominated, the problem must have exactly one component, i.e., \(m = 1\); in the notation of 3. Algorithm representation, \(m_{\textup{func}} = 1\) and \(m_{\textup{op}} = 0\). This single component may still contain a list of function conditions (an intersection).

  • For WeakMintyVariationalInequality, the problem must have exactly one component, i.e., \(m = 1\); in the same notation, \(m_{\textup{op}} = 1\) and \(m_{\textup{func}} = 0\). This single component may still contain a list of operator conditions (an intersection).