Hi,
The dualize in the last version of Yalmip is so great. The computation time on solving the dualized prblem is only half of the original one! That's great!
However, that's only happened in the variable matrix without multi-block. My model is a kind of semidfinite relaxtions of combinatorial problems which have been solved by SDPA or sedumi. And I have all the data of 'mDIM,nBLOCK,bLOCKsTRUCT,c,F'.
My question is when nBLOCK=1, that's no problem. But when nBLOCK >1, the message is :
---------------------------------------
ans =
yalmiptime: 0.6720
solvertime: 0.7950
info: 'Infeasible problem (SeDuMi-1.3)'
problem: 1
dimacs: [NaN NaN NaN NaN NaN NaN]
-------------------------------------------
Need help~~~ Thanks a lot.
Bess