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 1098
A quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and the constraints are quadratic functions.
1
vote
Accepted
Complexity of convex quadratically constrained quadratic programming (QCQP)
According to the Wikipedia article at http://en.wikipedia.org/wiki/NP-hard it is NP-hard. The Wikipedia article gives as a reference a book which is available at http://www.stanford.edu/~boyd/cvxbook/ …
- 6,523