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 121682
Optimization with convex constraints and convex objectives; notions related to convex optimization such as sub-gradients, normal cones, separating hyperplanes
0
votes
1
answer
722
views
Prove the optimal solution to maximizing nuclear norm with constraints is attained at corner...
The nuclear norm (trace norm) of a matrix $X \in \Bbb R^{m \times n}$ is defined as
$$\|X\|_* := \sum_{i=1}^{\min(m,n)} \sigma_i(X)$$
where $\sigma_i(X)$ are the singular values of $X$.
The optimizat …
- 43