Timeline for Can one always find sparse solutions to an $\ell^1$-minimization problem?
Current License: CC BY-SA 4.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 19, 2022 at 2:10 | history | edited | Rodrigo de Azevedo | CC BY-SA 4.0 |
added 8 characters in body
|
Nov 17, 2022 at 14:25 | answer | added | jlewk | timeline score: 0 | |
Oct 8, 2014 at 13:55 | comment | added | Paglia | Thank you @Dirk, this seems really interesting... I will check | |
Oct 8, 2014 at 13:44 | comment | added | Dirk | Question reformulated in terms of the optimality system: $x^*$ is an $\ell^1$-minimal solution if $Ax^*=b$ and there exists $w$ such that $A^T w \in\partial\|x\|_1$. This says: there is no $m$-sparse solution if the range of $A^T$ (which is $m$-dimensional) does not intersect the $m$-dimensional faces of the unit cube. Answers to this question show that for $m\geq n/2$ this can not happen. (Unfortunately, $m$ and $n$ are swapped in the linked question.) | |
Oct 8, 2014 at 7:10 | answer | added | Jean-Luc Bouchot | timeline score: 1 | |
Oct 7, 2014 at 16:17 | history | edited | Paglia | CC BY-SA 3.0 |
edited title
|
Oct 7, 2014 at 16:11 | history | asked | Paglia | CC BY-SA 3.0 |