# Complexity of a quadratic program

I have a quadratic program: $$\displaystyle\min_{\mathbf{X}} (\mathbf{X^TQX +C^TX}) \quad{} \text{subject to} \quad{} \mathbf{A X \leq Y}$$ $\mathbf{Q}$ is positive definite and is $N \times N$, $\mathbf{A}$ is $M \times N$ and $\mathbf{X}$ is an $N \times 1$ vector. I'm trying to compute the complexity in terms of multiplications, but can not figure out how to approach it. I'd appreciate it if anyone can provide help/guidance or any references I can check. I'm using the interior point convex algorithm.

-
Since Q is positive definite and the constraints are linear, the problem is convex and so in theory can be solved in polynomial time. For any kind of more detailed answer we will need a lot more information about what algorithm you're using the solve the QP. – user7530 Jan 2 '13 at 3:52
I'm using the interior point convex algorithm (updated question above). – SoCal93 Jan 2 '13 at 4:00
Using bold, particularly blackboard bold, Q, C to denote matrices isn't a good idea... – tomasz Jan 2 '13 at 4:11
Thanks. Question updated. – SoCal93 Jan 2 '13 at 4:16