Is there any way to solve the nonconvex problem caused by root sign in constraint conditions？

question2.png862×336 54.2 KB

This is a practical problem in scientific research. The variable is p, and its physical meaning is power value. The objective function can be proved to be a concave function, but it is not a convex optimization problem due to the root sign in the restriction condition. I wonder if there is any way to turn it into a convex optimization problem?
Thank you for your reply.

This is a non-convex problem. As far as I can tell, in order to get a convex problem, it would have to be changed into a different, non-equivalent, problem. if this is the problem you want to

solve, then CVX is not the right tool, and you should use a non-convex optimizer.

Thank you. Maybe I can try to solve this nonconvex problem with the projection gradient descent algorithm