X-Git-Url: https://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=aaf796ff3b89f3546110c7604ee14142f2819c16;hb=f9c11a761f23f781495171c2b3136a92388a18a1;hp=a75a1aa011f36a3d0ac1ee9aa18d70073dcb895e;hpb=e48dec4e5ae09d18c4e76d8ae7191ec0f42550bf;p=dunshire.git

diff --git a/TODO b/TODO
index a75a1aa..aaf796f 100644
--- a/TODO
+++ b/TODO
@@ -3,13 +3,6 @@
 
 2. Add unit testing for crazier things like random invertible matrices.
 
-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.
@@ -18,3 +11,12 @@
 
 9. Make it work on a cartesian product of cones in the wrong order
    (apply a perm utation before/after).
+
+10. Add (strict) cone containment tests to sanity check e1,e2.
+
+11. 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.
+
+12. Make sure we have the dimensions of the PSD cone correct.
+
+13. Use a positive tolerance when comparing floating point numbers.