Register to reply

Complexity of a quadratic program

Share this thread:
Socal93
#1
Jan3-13, 02:04 PM
P: 2
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.
Phys.Org News Partner Science news on Phys.org
Mysterious source of ozone-depleting chemical baffles NASA
Water leads to chemical that gunks up biofuels production
How lizards regenerate their tails: Researchers discover genetic 'recipe'
lavinia
#2
Jan3-13, 07:53 PM
Sci Advisor
P: 1,716
You have caught my curiosity. What is meant by the complexity of a quadratic program?
Socal93
#3
Jan3-13, 08:38 PM
P: 2
I'm trying to determine the computational complexity or the time it takes to solve the above problem.

lavinia
#4
Jan3-13, 08:41 PM
Sci Advisor
P: 1,716
Complexity of a quadratic program

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


Register to reply

Related Discussions
Quadratic fortran program help Programming & Computer Science 10
Quadratic equations and inequalities / applications of quadratic functions question Precalculus Mathematics Homework 3
Quadratic Equations and Inequalities question about properties of quadratic General Math 2