Open 19982084685 opened 2 years ago
Does your SDP problem come from a convex relaxation of a polynomial optimization problem?
I have some SDP problems to solve and I have implemented them in MATLAB using CVX. But the sedumi solver is not good enough, I want to try it with your solver, but I don't know how to start. Do you have any suggestions? Thank you in advance.
I am coding the Rank-Constrained Separable Semidefinite Programming Optimal Beamforming (SDR) with CVX. But I think it's hard for me to reproducing pseudocode.
I have some SDP problems to solve and I have implemented them in MATLAB using CVX. But the sedumi solver is not good enough, I want to try it with your solver, but I don't know how to start. Do you have any suggestions? Thank you in advance.