Rename "xi" and "gamma" to "p" and "q" to avoid name clashes with CVXOPT.

[dunshire.git] / TODO

diff --git a/TODO b/TODO
index 4dee0ae8fb2e832b96c845ebaef1e82f1eb89337..b0b503bc4465b5048b83ffbe91b375ea73ac6e09 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,29 +1,15 @@
-1. Add doctests for simple examples like the ones in Dr. Gowda's paper
-   and the identity operator.
+1. Add unit testing for crazier things like random invertible matrices.
 
-2. Add unit testing for crazier things like random invertible matrices.
+2. Try to eliminate the code in matrices.py.
 
-3. Test that the primal/dual optimal values always agree (this implies
-   that we always get a solution).
+3. Make it work on a cartesian product of cones in the correct order.
 
-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
+4. 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.
+5. Make sure we have the dimensions of the PSD cone correct.
 
-12. Make sure we have the dimensions of the PSD cone correct.
+6. 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.
+7. Should our one exception also spit out the game parameters?