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 qcqp
Search options answers only
not deleted
user 11142
A quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and the constraints are quadratic functions.
4
votes
Nearest matrix orthogonally similar to a given matrix
Depends what you mean by "technique". Your problem is a quadratically constrained quadratic program. To be precise, the objective function is
$$\mbox{tr} (A-TBT^t)(A^t - TB^t T^t) = \mbox{tr} ( AA^t …
- 96.4k
3
votes
Eigenvalue problem with two quadratic constraints
Generically, your system will have no solution, since $\mathbf{x}^t B \mathbf{x}$ is rarely zero for full-rank matrices. In the special case where $B$ is a degenerate symmetric matrix, then $x$ is in …
- 96.4k