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

diff --git a/TODO b/TODO
index 9b54805..4c7452f 100644
--- a/TODO
+++ b/TODO
@@ -1,23 +1,6 @@
-1. Add unit testing for crazier things like random invertible matrices.
+1. Implement the SPD cone.
 
-2. Copy the intro from my thesis into README.rst, and add a section
-   explaining the CVXOPT formulation.
-
-3. Try to eliminate the code in matrices.py.
-
-4. Make it work on a cartesian product of cones in the correct order.
-
-5. Make it work on a cartesian product of cones in the wrong order
-   (apply a perm utation before/after).
-
-6. 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.
-
-7. Make sure we have the dimensions of the PSD cone correct.
-
-8. Come up with a fast heuristic (like making nu huge and taking e1 as
-   our point) that finds a primal feasible point.
-
-9. We only need to include the API docs for dunshire.games in the
-   "user manual;" everything else can go in an appendix.
+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 wrong order
+   (apply a permutation before/after).