X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=6b2a90a76c1d059ed3fbc2ddd35491650996f9e0;hb=f8fecdbad5e7c25c5e87b1b4b652b9fa694f0ace;hp=ab87751f3168ceecdf739128a222dd766828c377;hpb=920c93e69916d70c293c8ab0caccb0b4d8ffb073;p=dunshire.git

diff --git a/TODO b/TODO
index ab87751..6b2a90a 100644
--- a/TODO
+++ b/TODO
@@ -1,23 +1,18 @@
 1. Add unit testing for crazier things like random invertible matrices.
 
-2. Add real docstrings everywhere.
+2. Try to eliminate the code in matrices.py.
 
-3. Try to eliminate the code in matrices.py.
+3. Make it work on a cartesian product of cones in the correct order.
 
-4. Make it work on a cartesian product of cones in the correct order.
-
-5. Make it work on a cartesian product of cones in the wrong order
+4. Make it work on a cartesian product of cones in the wrong order
    (apply a perm utation before/after).
 
-6. Rename all of my variables so that they don't conflict with CVXOPT.
+5. 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.
 
-7. Make sure we have the dimensions of the PSD cone correct.
-
-8. Use a positive tolerance when comparing floating point numbers.
+6. Make sure we have the dimensions of the PSD cone correct.
 
-9. Come up with a fast heuristic (like making nu huge and taking e1 as
+7. Come up with a fast heuristic (like making nu huge and taking e1 as
    our point) that finds a primal feasible point.
 
-10. Ensure that we only compute eigenvalues of *symmetric* matrices
-    (so that the eigenvalues are real).
+8. Should our one exception also spit out the game parameters?