Hi this is my object function. And the variables are the scalar pUL_ik and the vector g_k. The constraints are all linear inequalities. Well, i have proved that the object is convex subject to
the relative angle between g and b is in the range of (-pi/2, pi/2).
Can i use cvx to solve this optimization problem?
Besides, I have tried using cvx but i got this problem:
“Error using .*
Disciplined convex programming error:
Cannot perform the operation: {concave} .* {complex affine}”. Any suggestions are much appreciated.
That is not convex. If pUL_ik were input data rather than an optimization variable, it would be convex.
To be convex, the argument of abs would need to be affine. But the argument of abs in the objective has sqrt(variable), which is concave, times a variable (which is complex affine).
2 Likes