Timeline for Matrix reconstruction puzzle
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 12, 2021 at 16:49 | history | suggested | CWC | CC BY-SA 4.0 |
corrected typo
|
| Apr 12, 2021 at 16:29 | review | Suggested edits | |||
| S Apr 12, 2021 at 16:49 | |||||
| Apr 10, 2021 at 13:26 | comment | added | Federico Poloni | Rechecked, thanks. Feel free to edit the answer if you spot more typos. | |
| Apr 10, 2021 at 13:26 | history | edited | Federico Poloni | CC BY-SA 4.0 |
rechecked and fixed some typos
|
| Apr 10, 2021 at 13:24 | vote | accept | CWC | ||
| Apr 10, 2021 at 13:24 | comment | added | CWC | That makes perfect sense. I think there are still some typos though. Thanks again! | |
| Apr 10, 2021 at 12:43 | comment | added | Federico Poloni | @ChanwooChun Sorry, I had switched $D$ and $I-D$ in my head at some point; now it should be fixed (and clearer). Anyhow, you do not need to do any linear programming; just compute the norm of each row of $B$, find the largest $n$ norms, and put ones in the corresponding rows of $D$. | |
| Apr 10, 2021 at 12:41 | history | edited | Federico Poloni | CC BY-SA 4.0 |
fixed blunder, keeping -> dropping
|
| Apr 10, 2021 at 12:24 | comment | added | CWC | Stupid question: it intuitively makes sense to find maximum solution, but how does minimizing $||DP^TA-P^TA||$ becomes maximizing $||DP^TA||$? | |
| Apr 10, 2021 at 12:22 | comment | added | CWC | I see. I meant Frobenius norm. So I need to permute the rows/columns of $D$ until I can maximize $||DB||$. Since the extreme points of Birkhoff polytope (polytope of doubly stochastic matrices) are permutation matrices, I can do linear programming to find the solution. Thanks! | |
| Apr 10, 2021 at 12:07 | history | answered | Federico Poloni | CC BY-SA 4.0 |