Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Semidefinite programming can be regarded as an extension of linear programming. In a semidefinite program, the goal is to optimize a linear function over the intersection of the cone of positive semidefinite matrices with some affine space.
4
votes
Accepted
Full rank submatrices of positive semidefinite matrix
Yes, this is true. To see this note that for $A$ positive semidefinite, $v^T A v = 0$ if and only if $Av = 0$. For the less obvious direction, write $A = B^TB$ for a real matrix $B$. Then $0 = v^TA …
4
votes
how to determine a biquadratic form is positive-definite
In general one doesn't expect to have nice necessary and sufficient conditions for checking positivity of a biquadratic form. The sum-of-squares methods outlined in these course notes provide an effi …
2
votes
Accepted
Standard solution to semidefinite program
I will assume throughout that the definition of positive semidefiniteness includes symmetry. The problem is to find the Euclidean projection of $b$ onto the convex set $R = \{Qa \mid Q\succeq 0\}$. …