X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=4c7452f01d7e6447bc6295971b39342c50678617;hb=a098e91f815fbe4b90dbe965262d7ff66cd5f2f7;hp=6b2a90a76c1d059ed3fbc2ddd35491650996f9e0;hpb=f8fecdbad5e7c25c5e87b1b4b652b9fa694f0ace;p=dunshire.git

diff --git a/TODO b/TODO
index 6b2a90a..4c7452f 100644
--- a/TODO
+++ b/TODO
@@ -1,18 +1,6 @@
-1. Add unit testing for crazier things like random invertible matrices.
+1. Implement the SPD cone.
 
-2. Try to eliminate the code in matrices.py.
+2. Make it work on a cartesian product of cones in the correct order.
 
-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
-   (apply a perm utation before/after).
-
-5. Rename all of my variables so that they don't conflict with CVXOPT.
-   Maybe x -> xi and y -> gamma in my paper, if that works out.
-
-6. Make sure we have the dimensions of the PSD cone correct.
-
-7. Come up with a fast heuristic (like making nu huge and taking e1 as
-   our point) that finds a primal feasible point.
-
-8. Should our one exception also spit out the game parameters?
+3. Make it work on a cartesian product of cones in the wrong order
+   (apply a permutation before/after).