-1. Add doctests for simple examples like the ones in Dr. Gowda's paper
- and the identity operator.
+1. Make it work on a cartesian product of cones in the correct order.
-2. Add unit testing for crazier things like random invertible matrices.
-
-3. Test that the primal/dual optimal values always agree (this implies
- that we always get a solution).
-
-4. Run the tests with make test.
-
-5. Use pylint or whatever to perform static analysis.
-
-6. Add real docstrings everywhere.
-
-7. Try to eliminate the code in matrices.py.
+2. Make it work on a cartesian product of cones in the wrong order
+ (apply a perm utation before/after).
-8. Make it work on a cartesian product of cones in the correct order.
+3. Make sure we have the dimensions of the PSD cone correct.
-9. Make it work on a cartesian product of cones in the wrong order
- (apply a perm utation before/after).
+4. Come up with a fast heuristic (like making nu huge and taking e1 as
+ our point) that finds a primal feasible point.