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 lagrange-multipliers
Search options answers only
not deleted
user 141356
The method of Lagrange multipliers finds critical points (including maxima and minima) of a differentiable function subject to differentiable constraints.
3
votes
Minimize $f(A,B)$ s.t. $\text{exp}(A)^T \text{exp}(B)=J_K$
I'm posting some work I've done on your problem, this is not a full answer but I think it almost covers it all.
Loss function
$f$, as you wrote it, is linear. This is good enough, but that equation ca …
- 5,130
0
votes
How to solve MNP (minimum norm) problem in SVM?
I guess that if you perform a crisp linear SVM classifier between two groups, one of it being your data and the other being the null vector, either the algorithm will fail because 0 is in the convex h …
- 5,130