# How to solve the problem: {convex} .* {convex}

My code is as follows,
cvx_begin
variable R(para.M,para.M) complex
variable x(para.M,1) complex
expression t1
expression t3
expression t4

``````         minimize(t1+t3+t4)

subject to

t1=(para.sigma_z+(square_pos(norm(H_SI*x))))*inv_pos((2*30*(real(trace(A1_left*R*A1_left')))));

t3=(para.sigma_z+(square_pos(norm(H_SI*x))))*inv_pos((2*30*(real(trace(A1*R*A1')))));

t4=(para.sigma_z+(square_pos(norm(H_SI*x))))*inv_pos((2*30*(real(trace(A1_right*R*A1_right')))));

norm(R-R1)<=0.05;
[R   x;...
x'  1]==hermitian_semidefinite(para.M+1);
for k=1:(para.K)
h=H(:,k);
real(h'*x*s)*sin(pi/para.omiga) - abs( imag(h'*x*s) )*cos(pi/para.omiga) >= belta;
for t1=1:para.M
abs(x(t1))<=sqrt(Pt1(e)/para.M);
end
end
cvx_end
``````

and the expression is

Can you help me to solve this problem?Thank you!

The CVX wrong is

Disciplined convex programming error:
Cannot perform the operation: {convex} .* {convex}

z = feval( oper, x, y );

t1=(para.sigma_z+(square_pos(norm(H_SIx))))inv_pos((230(real(trace(A1_leftRA1_left’)))));

Have you proven this optimization problem is convex?