Suppose we have to minimze a function as:
minimize_{X,Y} Z
with some convex constraint.
where Z= A-b+c ,
and
A is a cvx convex expression (scalar), b=complex constant c= cvx complex affine expression (scalar). All Z, A,c is function consisting of X,y , then how it can be solved using cvx.
What does it even mean to minimize a complex expression? This is ill-posed. What does it mean to perform the comparison a<b when a and b are complex?
Sorry sir Z is not a complex expression… now how it can be solved…
There is absolutely no information here that would enable us to answer this question. You just disclaimed the only information that might suggest why this wouldn’t work.
