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

diff --git a/TODO b/TODO
index 24321b1..e8bf9e5 100644
--- a/TODO
+++ b/TODO
@@ -1,24 +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. 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
+2. 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.
+3. Make sure we have the dimensions of the PSD cone correct.
 
-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
+4. 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.
-
-10. Check value of dual Lyapunov game, and test over the ice creams.