X-Git-Url: https://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=d0c0bf980f5bc1cc3ffba2dc1f0a1beb30d72147;hb=dd63af7e3d3ec6b0f5ae78932c5e67df6b4fb29c;hp=2fe7ea4eab6b3fc44b571c8dcdb1272c6a4e153e;hpb=4452301cb189f61c1cafeba36ef6ee8c4e93161b;p=dunshire.git

diff --git a/TODO b/TODO
index 2fe7ea4..d0c0bf9 100644
--- a/TODO
+++ b/TODO
@@ -1,12 +1,13 @@
-1. Make it work on a cartesian product of cones in the correct order.
+1. Implement the SPD cone.
 
-2. Make it work on a cartesian product of cones in the wrong order
-   (apply a perm utation before/after).
+2. Make it work on a cartesian product of cones in the correct order.
 
-3. Make sure we have the dimensions of the PSD cone correct.
+3. Make it work on a cartesian product of cones in the wrong order
+   (apply a permutation before/after).
 
-4. Come up with a fast heuristic (like making nu huge and taking e1 as
-   our point) that finds a primal feasible point.
+4. Add random_game() and use it to replace all of the tests where
+   the cone is irrelevant. This should be done only after we are
+   feature complete and sure that everything works.
 
-5. Add a test to ensure that if we solve the same game twice, we get the
-   same answer back.
+5. Remove the one use of numpy.matrix in a doctest, since that's
+   an annoying dependency to have just to run the test suite.