X-Git-Url: https://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=d1773f6e10e8a2d4501fbe8ee674b71046069c03;hb=a050ae7de2580d78ddb157262560542e7dc3abac;hp=25beb4a3d326b8e9ef058c6df97b0c3a41083e50;hpb=6f1bf02d79a4c06075d128848d4e238f81440c52;p=dunshire.git

diff --git a/TODO b/TODO
index 25beb4a..d1773f6 100644
--- a/TODO
+++ b/TODO
@@ -1,20 +1,10 @@
-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. Add real docstrings everywhere.
-
-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. Use a positive tolerance when comparing floating point numbers.
-
-9. 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.
+