X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=TODO;h=e8bf9e55b3f09348b157b6dd295fb18442542cbc;hb=6b28e89a792679e30249f5c187feefa2bdfa18a6;hp=6b2a90a76c1d059ed3fbc2ddd35491650996f9e0;hpb=f8fecdbad5e7c25c5e87b1b4b652b9fa694f0ace;p=dunshire.git diff --git a/TODO b/TODO index 6b2a90a..e8bf9e5 100644 --- a/TODO +++ b/TODO @@ -1,18 +1,9 @@ -1. Add unit testing for crazier things like random invertible matrices. +1. Make it work on a cartesian product of cones in the correct order. -2. Try to eliminate the code in matrices.py. - -3. Make it work on a cartesian product of cones in the correct order. - -4. Make it work on a cartesian product of cones in the wrong order +2. Make it work on a cartesian product of cones in the wrong order (apply a perm utation before/after). -5. 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. +3. Make sure we have the dimensions of the PSD cone correct. -6. Make sure we have the dimensions of the PSD cone correct. - -7. Come up with a fast heuristic (like making nu huge and taking e1 as +4. Come up with a fast heuristic (like making nu huge and taking e1 as our point) that finds a primal feasible point. - -8. Should our one exception also spit out the game parameters?