-1. Add unit testing for crazier things like random invertible matrices.
+1. Make it work on a cartesian product of cones in the correct order.
-2. Try to eliminate the code in matrices.py.
-
-3. Make it work on a cartesian product of cones in the correct order.
-
-4. Make it work on a cartesian product of cones in the wrong order
+2. Make it work on a cartesian product of cones in the wrong order
(apply a perm utation before/after).
-5. Rename all of my variables so that they don't conflict with CVXOPT.
- Maybe x -> xi and y -> gamma in my paper, if that works out.
-
-6. Make sure we have the dimensions of the PSD cone correct.
+3. Make sure we have the dimensions of the PSD cone correct.
-7. Come up with a fast heuristic (like making nu huge and taking e1 as
+4. Come up with a fast heuristic (like making nu huge and taking e1 as
our point) that finds a primal feasible point.
-8. Should our one exception also spit out the game parameters?
+5. Add a test to ensure that if we solve the same game twice, we get the
+ same answer back.