where dk(n) is the distance between UAV and ground user, if we want to optimize 3D position of UAV distance make trouble due to square root and we have to do mush mathematics to tackle it.
my question is how to make it feasible to tackle the square root in cvx programming with little and easy approach.
please suggest me some thing to resolve this issue directly without a bulky mathematics.
Thanks;
Coming up with a good or adequate convex optimization problem to model your phenomenon of interest is up to you, and is out of scope of this forum.
You can consider whether you might be better off using a non-convex optimization problem formulation, for instance using YALMIP. But that is your decision to make.
;