How to solve the problem of cvx in the denominator? Pease!

Code:

cvx_begin

variable x_opt(1,2)

variable y_opt(1,2)

d1=pow_pos((x_opt(1,zz)-W48(jre1,1)),2)+pow_pos((y_opt(1,zz)-W48(jre1,2)),2);

h(jd)=G0*G1*beta0/d1;

cvx_end

Error:

How to solve the problem of cvx in the denominator? Pease!

Code:

cvx_begin

variable x_opt(1,2)

variable y_opt(1,2)

d1=pow_pos((x_opt(1,zz)-W48(jre1,1)),2)+pow_pos((y_opt(1,zz)-W48(jre1,2)),2);

h(jd)=G0*G1*beta0/d1;

cvx_end

Error:

What do you want to do with `h(jd)`

? Maybe you can multiply through the denominator when you use itm, rather than explicitly forming `h(jd)`

. Of course, for that to work, your optimization problem needs to be convex. You haven’t shown us what that problem is, so the forum readers don’t know. Your first task is to prove your optimization problem, whatever it is, is convex. if it is not convex, you can’t use CVX, but might be able to try YALMIP.

I’ll take a different approach. Thank you!