X-Git-Url: https://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=ab87751f3168ceecdf739128a222dd766828c377;hb=920c93e69916d70c293c8ab0caccb0b4d8ffb073;hp=b38d65aaf32f7f348767808f0df7ea9588810446;hpb=92c9e3f2e7d685477cf8227d85faf8642059fd98;p=dunshire.git

diff --git a/TODO b/TODO
index b38d65a..ab87751 100644
--- a/TODO
+++ b/TODO
@@ -1,19 +1,23 @@
-2. Add unit testing for crazier things like random invertible matrices.
+1. Add unit testing for crazier things like random invertible matrices.
 
-6. Add real docstrings everywhere.
+2. Add real docstrings everywhere.
 
-7. Try to eliminate the code in matrices.py.
+3. Try to eliminate the code in matrices.py.
 
-8. 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.
 
-9. Make it work on a cartesian product of cones in the wrong order
+5. 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.
+6. 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.
 
-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.
+7. Make sure we have the dimensions of the PSD cone correct.
 
-12. Make sure we have the dimensions of the PSD cone correct.
+8. Use a positive tolerance when comparing floating point numbers.
 
-13. Use a positive tolerance when comparing floating point numbers.
+9. 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).