X-Git-Url: https://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=1a67a6f867d5fa5d3bfd14b3a7fec0500392a318;hb=08abee864006192c364c25f22c3755e89e310b9b;hp=5dc0fded37116a1fb6332663191d8f6ec53cf6fb;hpb=750a4e1054ee94ceeb97b2671703c14cb26b022f;p=dunshire.git

diff --git a/TODO b/TODO
index 5dc0fde..1a67a6f 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.
 
@@ -14,4 +15,8 @@
 
 7. Make sure we have the dimensions of the PSD cone correct.
 
-8. Use a positive tolerance when comparing floating point numbers.
+8. Come up with a fast heuristic (like making nu huge and taking e1 as
+   our point) that finds a primal feasible point.
+
+9. We only need to include the API docs for dunshire.games in the
+   "user manual;" everything else can go in an appendix.