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

diff --git a/TODO b/TODO
index ab87751..783d4a9 100644
--- a/TODO
+++ b/TODO
@@ -1,6 +1,7 @@
 1. Add unit testing for crazier things like random invertible matrices.
 
-2. Add real docstrings everywhere.
+2. Copy the intro from my thesis into README.rst, and add a section
+   explaining the CVXOPT formulation.
 
 3. Try to eliminate the code in matrices.py.
 
@@ -19,5 +20,5 @@
 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).
+10. We only need to include the API docs for dunshire.games in the
+    "user manual;" everything else can go in an appendix.