one error,ask for help

(kullboys boys) #1

variables g aphPtotal
variable S(theta_len) complex
minimize g;
subject to
Zk = r-B*S;
norm(Zk) <= g;
Sumvector’*S <= aphPtotal;
for i=1:theta_len

Error using cvxprob/newcnstr (line 192)
Disciplined convex programming error:
Invalid constraint: {complex affine} <= {real affine}

Error in <= (line 21)
b = newcnstr( evalin( ‘caller’, ‘cvx_problem’, ‘[]’ ), x, y, ‘<=’ );

Error in l2_SVD (line 60)
Sumvector’*S <= aphPtotal;

(Mark L. Stone) #2

You have not provided a reproducible problem because you have not provided the input data. Please produce a minimally-sized self-contained problem which exhibits the error…

Nevertheless, per
One or both sides of an equality constraint may be complex; inequality constraints, on the other hand, must be real.

aphPtotal is real but the left-hand side is presumably complex because S is declared complex.SO the LHS of Sumvector’*S <= aphPtotal;; is complex, in violation of CVX’s rules.