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

diff --git a/TODO b/TODO
index 2fe7ea4..4c7452f 100644
--- a/TODO
+++ b/TODO
@@ -1,12 +1,6 @@
-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.
-
-5. Add a test to ensure that if we solve the same game twice, we get the
-   same answer back.
+3. Make it work on a cartesian product of cones in the wrong order
+   (apply a permutation before/after).