TODO

   1 1. Add unit testing for crazier things like random invertible matrices.
   2
   3 2. Copy the intro from my thesis into README.rst, and add a section
   4    explaining the CVXOPT formulation.
   5
   6 3. Try to eliminate the code in matrices.py.
   7
   8 4. Make it work on a cartesian product of cones in the correct order.
   9
  10 5. Make it work on a cartesian product of cones in the wrong order
  11    (apply a perm utation before/after).
  12
  13 6. Rename all of my variables so that they don't conflict with CVXOPT.
  14    Maybe x -> xi and y -> gamma in my paper, if that works out.
  15
  16 7. Make sure we have the dimensions of the PSD cone correct.
  17
  18 8. Use a positive tolerance when comparing floating point numbers.
  19
  20 9. Come up with a fast heuristic (like making nu huge and taking e1 as
  21    our point) that finds a primal feasible point.
  22
  23 10. We only need to include the API docs for dunshire.games in the
  24     "user manual;" everything else can go in an appendix.