X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=4c7452f01d7e6447bc6295971b39342c50678617;hb=63aea7c83b0d3d364d01597828ca06371004eec4;hp=d23728e534602656da527a224820370d1152da2d;hpb=dd98bb15beba1e9eae310598e1b55a7dd9d4aa01;p=dunshire.git

diff --git a/TODO b/TODO
index d23728e..4c7452f 100644
--- a/TODO
+++ b/TODO
@@ -1,14 +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.
-
-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. 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
-   our point) that finds a primal feasible point.
+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).