I have the following semi-definite programming problem

subject to the constraints

where, M \in R^+ and X is a PSD (F \times F) symmetric matrix.

I want to estimate its order of complexity using the expression O((mn^3+m^2n^2+m^3)\sqrt{n}\log\frac{1}{\epsilon}) where, n is the dimensions of the final matrix X and m is the number of equality constraints.

To help me with this issue i proceeded in a standard fashion by adding slack variables to the inequality constraints. However, the reported number of variables and equality constraints in SeDuMi output is below what i have estimated. So, is there any tutorial describing how SeDuMi in CVX estimates those values ? In other words i need a detailed description of SeDuMi output fields and how they were estimated

Regards,