X-Git-Url: https://gitweb.michael.orlitzky.com/?a=blobdiff_plain;ds=sidebyside;f=TODO;h=783d4a9d4136683d9da2b39d7d11c2100314bcdc;hb=27226106ec54fd64292c8fc963cdd7aea22d2b8a;hp=5dc0fded37116a1fb6332663191d8f6ec53cf6fb;hpb=750a4e1054ee94ceeb97b2671703c14cb26b022f;p=dunshire.git

diff --git a/TODO b/TODO
index 5dc0fde..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.
 
@@ -15,3 +16,9 @@
 7. Make sure we have the dimensions of the PSD cone correct.
 
 8. 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. We only need to include the API docs for dunshire.games in the
+    "user manual;" everything else can go in an appendix.