cvx_begin
variable V(N,K) complex;
variable t(N);
minimize (weight'*t);
subject to
0 <= t <= sPmax;
for ii=1:1:N
norm(V(ii,:),2) <= t(ii);
end
for jj=1:1:K
imag(H(jj,:)*V(:,jj)) == 0;
norm([H(jj,:)*V,sqrt(N0*W)],2) <= sqrt(1+d(jj))*real(H(jj,:)*V(:,jj));
end
cvx_end
Hi, I am trying to solve the above SOCP using CVX. The problem is when I use SDPT3 as solver, it does output the status as “solved”. However, the result is obviously wrong. The running log says “lack of progress in infeas” after about 10 iterations. When I switch to SeDuMi, most of time, it can give me the right answer. However, sometimes “Inaccurate” or “Failed” may occur. I am quite confused what’s going on here. Please help.