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

diff --git a/TODO b/TODO
index a75a1aa..4c7452f 100644
--- a/TODO
+++ b/TODO
@@ -1,20 +1,6 @@
-1. Add doctests for simple examples like the ones in Dr. Gowda's paper
-   and the identity operator.
+1. Implement the SPD cone.
 
-2. Add unit testing for crazier things like random invertible matrices.
+2. Make it work on a cartesian product of cones in the correct order.
 
-3. Test that the primal/dual optimal values always agree (this implies
-   that we always get a solution).
-
-4. Run the tests with make test.
-
-5. Use pylint or whatever to perform static analysis.
-
-6. Add real docstrings everywhere.
-
-7. Try to eliminate the code in matrices.py.
-
-8. Make it work on a cartesian product of cones in the correct order.
-
-9. Make it work on a cartesian product of cones in the wrong order
-   (apply a perm utation before/after).
+3. Make it work on a cartesian product of cones in the wrong order
+   (apply a permutation before/after).