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

diff --git a/TODO b/TODO
index 2ab222a..2fe7ea4 100644
--- a/TODO
+++ b/TODO
@@ -1,25 +1,12 @@
-1. Add doctests for simple examples like the ones in Dr. Gowda's paper
-   and the identity operator.
+1. Make it work on a cartesian product of cones in the correct order.
 
-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.
-
-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.
+3. 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.
 
-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.
+5. Add a test to ensure that if we solve the same game twice, we get the
+   same answer back.