Skip to main content

Semi definite programming and direct support for trace of matrix?



1 comment

  • Yuriy Zinchenko
    Gurobi Staff Gurobi Staff

    In its current form, no, but ...

    Although Gurobi does not implement barrier or any other algorithms for SDP, if you have a toy-sized SDP model, we can still do something with it starting from the upcoming release 9.0 (by the end of Nov 2019).  Note with 9.0 we allow non-convex quadratics, e.g., equality constraints like x^2 == y, which in turn permits building multi-variate polynomial constraints.  Now, in all the likelihood you will not be able to deal with polynomial-equality constraints for large degrees, however, for "small" matrices I would certainly try re-expressing SDP constraints as a set of, say, polynomial inequalities on determinants of the principal minors, e.g., see here,

    It may be worth a try, so hope it helps.


Please sign in to leave a comment.