Complexity of a quadratic program

Socal93
Messages
2
Reaction score
0
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.
 
Physics news on Phys.org
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.
 
Socal93 said:
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.
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

A Are these two optimization problems equivalent?
Replies
1
Views
1K
I Canonical Form for quadratic equations *with* linear terms
Replies
4
Views
3K
Calculate the Electric and Magnetic field for this Multipole Radiation
Replies
19
Views
2K
I Help understanding conditional expectation identity
Replies
1
Views
2K
I On error estimates of approximate solutions
Replies
1
Views
3K
I Wronskian: null space equals the span of independent functions
Replies
23
Views
1K
I Principal and Gaussian curvature of the FRW metric
Replies
8
Views
1K
A How to show spin ##= \pm 2/\omega## for a circ-polarized gravity wave
Replies
0
Views
1K
I On the approximate solution obtained through Euler's method
Replies
1
Views
3K
A Representation number via quad forms of theta quadratic form
Replies
6
Views
2K

Hot Threads

Recent Insights

Back
Top