If a SOCP problem is loaded by CVX, and the parameters are listed as:

variables:

totally have A scalar variables

, and B (M*N matrix) variable

cone constraints:

C constraints.

So what is the computational complexity of this problem?

Thanks for your attention!