diff options
| author | Nao Pross <np@0hm.ch> | 2024-05-11 19:02:01 +0200 |
|---|---|---|
| committer | Nao Pross <np@0hm.ch> | 2024-05-11 19:02:01 +0200 |
| commit | e3ad76e4b6cf6d73f5ac679ddad0aba0e8e0c913 (patch) | |
| tree | e31879a4a7e91e32bfa7aa8261d378540cf198ea | |
| parent | Whitespace (diff) | |
| download | sumofsquares-e3ad76e4b6cf6d73f5ac679ddad0aba0e8e0c913.tar.gz sumofsquares-e3ad76e4b6cf6d73f5ac679ddad0aba0e8e0c913.zip | |
Add TODO
| -rw-r--r-- | sumofsquares/solver/cvxopt.py | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/sumofsquares/solver/cvxopt.py b/sumofsquares/solver/cvxopt.py index a608546..3b227c7 100644 --- a/sumofsquares/solver/cvxopt.py +++ b/sumofsquares/solver/cvxopt.py @@ -117,6 +117,7 @@ def solve_sos_cone(prob: Problem, verbose: bool = False, elif isinstance(c, EqualToZero | NonNegative): # Convert constraints to affine expression in decision variables + # TODO: Use half Newton polytope optimization to reduce size of marix problem constr = poly.to_affine(c.expression.quadratic_in(x).read(prob.state)) if constr.degree > 1: raise ValueError("CVXOpt can solve problem with constraints that are " |