Question: How can I solve a complex semidefinite program (SDP) with Maple?

Hello Maple experts,

I'm currently trying to get more familiar with semidefinite programs (SDP), i.e. I want to minimize/maximize a linear objective matrix function over linear equality/inequality constraints with a positive semidefinite matrix condition.

It seems that there are a number of Matlab packages available but so far I couldn't really see how I could do this with Maple (which I would prefer to Matlab if there is a reasonable solution...)

Maple's Optimization[LPSolve] command does not seem to handle complex matrices. However, as I'm still learning about SDPs I might miss something here...

So has anyone done something like this with Maple or can give a hint how to approach such kind of problem? Thanks in advance!