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!

What is the time complexity of solving an SOCP problem when using SeDuMi or SDPT3 solvers through cvx? There are many papers about SeDuMi or SDPT3 solvers in literature, but they only discuss the numerical results of the algorithms. Is there any theoratical results about the time complexity of SeDuMi or SDPT3 solvers when sloving SOCP problems which includes worst-case iteration bound and complexity per iteration.