X-Git-Url: https://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=94690840107c6dd0dd8613fb450b9f4b3121f7aa;hb=ff9a508f946f02c9c8896ebadccf2a44525a52a9;hp=e8bf9e55b3f09348b157b6dd295fb18442542cbc;hpb=d90b0b66e1983af5268fb1784907004e12b48dfa;p=dunshire.git

diff --git a/TODO b/TODO
index e8bf9e5..9469084 100644
--- a/TODO
+++ b/TODO
@@ -1,9 +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.
+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.