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 convex-optimization
Search options answers only
not deleted
user 4312
Optimization with convex constraints and convex objectives; notions related to convex optimization such as sub-gradients, normal cones, separating hyperplanes
7
votes
Accepted
Maximizing trace subject to two equality constraints
If ${\rm rank} \, X>1$, there exists a two-dimensional space $\mathcal{L}$ such that the restriction of $X$ to $\mathcal{L}$ is positive definite. The space of Hermitian operators, which vanish on $\ …
- 109k
2
votes
Famous theorems that are special cases of linear programming (or convex) duality
Bondareva–Shapley_theorem is quite famous in a game theory. In more modern terms, it unites the usual and dual description of the generalized permutohedron.
4
votes
Accepted
Is this function always bounded below?
Now I think that no, even if we remove the negative summands $-x_i+(1-x_i)\log(1-x_i)$. Note that our inequality becomes homogeneous, so we may forget that $x_i$ are less than 1. Choose $x_i=1+t_i$ so …
- 109k