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 quadratic-programming
Search options questions only
not deleted
user 85550
A quadratic program (QP) is an optimization problem in which the objective function is quadratic and the feasible region is a convex polytope.
2
votes
1
answer
326
views
A "nice" (but non-definite) quadratic programme
For integers $n\geq k>0$, let $f$ be the following quadratic form:
$$f(x_1,\ldots,x_n)=\sum_{i=1}^n\sum_{j=0}^{k-1}x_ix_{i+j\bmod n}.$$
Is it true that the minimum of $f$ over the unit simplex is atta …
- 947
2
votes
2
answers
104
views
Correlation between the first and a random position of an ergodic bit sequence
Edit: Since the geometric approach did not work, I try now another approach: phrasing the problem as a quadratic programme.
Probabilistic version.
Let $x=(x_1,x_2, \ldots) $ be an ergodic random seq …
- 947