## Complexity of a quadratic program

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.
 PhysOrg.com science news on PhysOrg.com >> Ants and carnivorous plants conspire for mutualistic feeding>> Forecast for Titan: Wild weather could be ahead>> Researchers stitch defects into the world's thinnest semiconductor
 Recognitions: Science Advisor You have caught my curiosity. What is meant by the complexity of a quadratic program?
 I'm trying to determine the computational complexity or the time it takes to solve the above problem.

Recognitions:
Science Advisor

## Complexity of a quadratic program

 Quote by Socal93 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.

 Tags linear alegbra, opimization, quadratic program
 Thread Tools

 Similar Threads for: Complexity of a quadratic program Thread Forum Replies Programming & Comp Sci 10 Precalculus Mathematics Homework 3 General Math 2