Complexity of a quadratic program

[Socal93]

I'm trying to compute the complexity of the quadratic program: $$\displaystyle\min_{\mathbf{X}} (\mathbf{X^TQX +C^TX}) \quad{} \text{subject to} \quad{} \mathbf{A X \leq Y}$$
A is MxN and X is Nx1. Q is positive definite and I'm using the interior point method. Any help in computing the complexity would be appreciated.

 

[lavinia]

You have caught my curiosity. What is meant by the complexity of a quadratic program?

 

[Socal93]

I'm trying to determine the computational complexity or the time it takes to solve the above problem.

 

[lavinia]

I'm trying to determine the computational complexity or the time it takes to solve the above problem.

Don't know anything about that. I do know that the Wolf algorithm reduces the quadratic program to a finite sequence of linear programs.