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-analysis
Search options not deleted
user 129831
5
votes
1
answer
386
views
Proving equivalence of two definitions of a convex-type Hamming distance
Update: If somebody can answer my question there, then I will be able to fully answer my question here.
Consider $n\in\mathbb N$ and a non-empty set $M\subset\{0,1\}^n$. I have the following conjectur …
- 1,326
3
votes
Accepted
Proving equivalence of two definitions of a convex-type Hamming distance
Answer inspired by this great answer to a very related question by Paata Ivanishvili.
The right-hand side is equal to $\min_{m\in\operatorname{conv}(M)} \lVert m\rVert_2$, where $\operatorname{conv}(M …
- 1,326