How can I solve this problem?Status: Infeasible

[jackfsuia (Jack)]

Some words in the following might help.

How to write log(1+Ax)? A are two constant

The output shows that CVX’s Successive Approximation method was used with SDPT3 as solver. cvx_solver mosek is commented out. But as @Erling wrote, it would be better to use Mosek (with CVX 2.2) thereby avoiding CVX’s Successive Approximation method, and getting a more robust and reliable solution. As for infeasible problems, follow the advice, except for section 1, in https://yalmip.github.io/debugginginfeasible, which also applies to CVX.