X-Git-Url: https://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=94690840107c6dd0dd8613fb450b9f4b3121f7aa;hb=ff9a508f946f02c9c8896ebadccf2a44525a52a9;hp=b0b503bc4465b5048b83ffbe91b375ea73ac6e09;hpb=fa8fa4d690c5f30f7d5fee1818a9b4c15f52c5ff;p=dunshire.git

diff --git a/TODO b/TODO
index b0b503b..9469084 100644
--- a/TODO
+++ b/TODO
@@ -1,15 +1,10 @@
-1. Add unit testing for crazier things like random invertible matrices.
+1. Implement the SPD cone.
 
-2. Try to eliminate the code in matrices.py.
+2. Make it work on a cartesian product of cones in the correct order.
 
-3. Make it work on a cartesian product of cones in the correct order.
+3. Make it work on a cartesian product of cones in the wrong order
+   (apply a permutation before/after).
 
-4. Make it work on a cartesian product of cones in the wrong order
-   (apply a perm utation before/after).
-
-5. 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.
-
-7. Should our one exception also spit out the game parameters?
+4. Add random_game() and use it to replace all of the tests where
+   the cone is irrelevant. This should be done only after we are
+   feature complete and sure that everything works.