I want to solve the following SOCP problem by CVX:

Unfortunately,my code always tell me it is infeasible.I always think there’s something wrong with my code,Hope you can provide me with some help from your experience.Thanks ,all my best!

`cvx_begin variable deta(3,1) variable zij(N,M) variable miu expression t expression lamda3 minimize(miu) subject to for i = 1:N norm(Q(:,j)+deta-E(:,i)) <= ((deta(3,1)+Q(3,j))/LoS_c); end for i = 1:N if a(i,j) >= 0.5 t = (zij(i,j)-rij(i,j))/lamda2(i,j)-D(i,j)^2; end norm([Q(:,j)+deta-E(:,i);t]) <= (t - 1/2); end for jj = 1:M for ii = 1:N if a(ii,jj) >= 0.5 lamda3 = lamda3+Di(ii)*inv_pos(zij(ii,jj))+Fi(ii)/f_uav; end end miu >= lamda3; end cvx_end`