X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=e8bf9e55b3f09348b157b6dd295fb18442542cbc;hb=f5b5ef66e41ae0538eb32e4b8420c36a23b95361;hp=b0b503bc4465b5048b83ffbe91b375ea73ac6e09;hpb=fa8fa4d690c5f30f7d5fee1818a9b4c15f52c5ff;p=dunshire.git

diff --git a/TODO b/TODO
index b0b503b..e8bf9e5 100644
--- a/TODO
+++ b/TODO
@@ -1,15 +1,9 @@
-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. Try to eliminate the code in matrices.py.
-
-3. Make it work on a cartesian product of cones in the correct order.
-
-4. 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).
 
-5. Make sure we have the dimensions of the PSD cone correct.
+3. Make sure we have the dimensions of the PSD cone correct.
 
-6. 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.
-
-7. Should our one exception also spit out the game parameters?