X-Git-Url: http://gitweb.michael.orlitzky.com/?p=dunshire.git;a=blobdiff_plain;f=TODO;h=2fe7ea4eab6b3fc44b571c8dcdb1272c6a4e153e;hp=783d4a9d4136683d9da2b39d7d11c2100314bcdc;hb=428ef4a28dc25409df02f6af024043c21307a646;hpb=27226106ec54fd64292c8fc963cdd7aea22d2b8a

diff --git a/TODO b/TODO
index 783d4a9..2fe7ea4 100644
--- a/TODO
+++ b/TODO
@@ -1,24 +1,12 @@
-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. Copy the intro from my thesis into README.rst, and add a section
-   explaining the CVXOPT formulation.
-
-3. Try to eliminate the code in matrices.py.
-
-4. Make it work on a cartesian product of cones in the correct order.
-
-5. 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).
 
-6. 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.
-
-7. Make sure we have the dimensions of the PSD cone correct.
-
-8. Use a positive tolerance when comparing floating point numbers.
+3. Make sure we have the dimensions of the PSD cone correct.
 
-9. 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.
 
-10. We only need to include the API docs for dunshire.games in the
-    "user manual;" everything else can go in an appendix.
+5. Add a test to ensure that if we solve the same game twice, we get the
+   same answer back.