X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=94690840107c6dd0dd8613fb450b9f4b3121f7aa;hb=dd58b25641f37f52b7327b1b779a606c33e230eb;hp=d1773f6e10e8a2d4501fbe8ee674b71046069c03;hpb=a050ae7de2580d78ddb157262560542e7dc3abac;p=dunshire.git

diff --git a/TODO b/TODO
index d1773f6..9469084 100644
--- a/TODO
+++ b/TODO
@@ -1,10 +1,10 @@
-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.
-
-4. Come up with a fast heuristic (like making nu huge and taking e1 as
-   our point) that finds a primal feasible point.
+3. Make it work on a cartesian product of cones in the wrong order
+   (apply a permutation before/after).
 
+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.