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

diff --git a/TODO b/TODO
index a75a1aa..2fe7ea4 100644
--- a/TODO
+++ b/TODO
@@ -1,20 +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.
+2. Make it work on a cartesian product of cones in the wrong order
+   (apply a perm utation before/after).
 
-7. Try to eliminate the code in matrices.py.
+3. Make sure we have the dimensions of the PSD cone correct.
 
-8. Make it work on a cartesian product of cones in the correct order.
+4. Come up with a fast heuristic (like making nu huge and taking e1 as
+   our point) that finds a primal feasible point.
 
-9. Make it work on a cartesian product of cones in the wrong order
-   (apply a perm utation before/after).
+5. Add a test to ensure that if we solve the same game twice, we get the
+   same answer back.