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 100927
A quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and the constraints are quadratic functions.
3
votes
Maximize the Euclidean norm of a matrix times a vector on unit sub-spheres
You can write $AX=\sum_{i=1}^N A_i x_i$ with $A_i\in \mathbb{R}^{r\times m}$. Then we have
$$
\|AX\|^2=(AX)^TAX=\sum_{i,j} x^T_i A_i^TA_jx_j.
$$
The condition for a critical point is
$$
A_i^TAX=\alpha …
- 398