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 | |
Results tagged with semidefinite-programming
Search options not deleted
user 76046
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.
2
votes
1
answer
432
views
how to determine a biquadratic form is positive-definite
A biquadratic form $\sum_{i,j,k,l}b_{i,j,k,l}x_{i}x_{j}y_{k}y_{l}$，
how to determine whether it is positive-definite？
A necessary and sufficient condition？
In fact, I have a matrix $B=\sum_{1\leq i …
- 8,501