Hello,
I am trying to achieve the following:
1) use Yalmip to define a complex SDP problem with a range of sdpvar() objects and constraints between them
2) extract the primal of this problem in canonical form, i.e. in the form "min_X <C,X> s.t. <Ai,X> <= bi, X is PSD" (or an analogous formulation with block matrices Xj so that X = blkdiag(X1,...,XJ)). This is relevant since it is non-trivial to write down the primal canonical form
3) Run a method to find an X (an oracle that can only process SDPs in the above canonical form and does not obtain dual solutions)
4) Fill the solution of X in the original sdpvar() objects
So far, I looked into the export() function and to my understanding this makes use of primal/dual pairs, e.g. for step 4) the dual solution seems to be used. What would be the simplest way to achieve the above?
Any hints are much appreciated.
Thanks,
Sid