As shown in the picture, the parameters of a,b,c are positive contants. Obviously, the expression is convex, but how to directly write it in CVX form? And I mean that we should not apply any slack conditions or the successive approximation method.

Many papers said this expression is convex and can be solved by optimization tools. I do not know how to directly solve it with CVX, who can tell me how to solve this? Thanks!

Thanks. I guess your method is feasible. However, I still want to know if the expression is changed into \log(a+\frac{b}{x+c})\leq y, with y>0. Is there any method to solve this in CVX form?

Thank you. If possible, can you show me more details on how to write this constraint in CVX code based on Conic method. Because I still feel confused to the PDF attachment.

then you have the case in the cheat sheet. It should be easy to adapt the idea from the cheat sheet to more general a.

The exponential cone and rotated quadratic cone required by cheat sheet solution can be handled by Cvx, but it might be easier and more efficient to use Mosek directly.

There might also be another way of doing that fits Cvx better but at least you know one way now.