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 not deleted
user 168789
Optimization with convex constraints and convex objectives; notions related to convex optimization such as sub-gradients, normal cones, separating hyperplanes
0
votes
Accepted
How to find $y_u?$
Thanks to this answer.
As $L$ is symmetric,
\begin{align}
\frac{d (E(S, \textbf{y}))}{d y_u} = 0 + y_l^TL^{l,u} + (L^{u,l}y_l)^T + y_u^TL^{u, u} + (L^{u, u}y_u)^T = 0
\\
2 y_l^T L^{L, u} + 2y_u^T L^{ …
- 13
0
votes
1
answer
87
views
How to find $y_u?$
In the paper Semi-supervised learning by mixed label propagation Wei Tong and Rong Jin define
$S$ as the similarity(adjacency) matrix
$D = \operatorname{diag}(D_1, D_2, \ldots, D_n)$ where $D_i = \sum …
- 13