High-order problem cannot be solved some time?

Hi, I’m working with a GP problem using CVX with mosek. The variables are K1,K1 and M*K dimensional and I’m only changing K now. When K=4, the optimization problem is smoothly solved. But if K=8 or greater, CVX status turns to be infeasible and optval is 0. I’m confused and wondering how to handle it. I would appreciate it if you help me.

I doubt anyone will be able to provide specific help unless you show a reproducible problem.

However, you can follow the advice in Debugging infeasible models - YALMIP, all but section 1 of which also applies to CVX.