X-Git-Url: http://gitweb.michael.orlitzky.com/?p=dunshire.git;a=blobdiff_plain;f=TODO;h=2fe7ea4eab6b3fc44b571c8dcdb1272c6a4e153e;hp=b38d65aaf32f7f348767808f0df7ea9588810446;hb=428ef4a28dc25409df02f6af024043c21307a646;hpb=92c9e3f2e7d685477cf8227d85faf8642059fd98

diff --git a/TODO b/TODO
index b38d65a..2fe7ea4 100644
--- a/TODO
+++ b/TODO
@@ -1,19 +1,12 @@
-2. Add unit testing for crazier things like random invertible matrices.
+1. Make it work on a cartesian product of cones in the correct order.
 
-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
+2. 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.
+3. Make sure we have the dimensions of the PSD cone correct.
 
-12. Make sure we have the dimensions of the PSD cone correct.
+4. Come up with a fast heuristic (like making nu huge and taking e1 as
+   our point) that finds a primal feasible point.
 
-13. Use a positive tolerance when comparing floating point numbers.
+5. Add a test to ensure that if we solve the same game twice, we get the
+   same answer back.