Timeline for Ideas on Matrix Factorization / Transformations for $ {L}_{1} $ Minimization
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 16, 2020 at 19:02 | vote | accept | AnonSubmitter85 | ||
| Jul 7, 2018 at 22:27 | history | edited | Royi | CC BY-SA 4.0 |
edited tags; edited title
|
| Aug 31, 2017 at 6:39 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 20, 2017 at 15:56 | answer | added | Royi | timeline score: 2 | |
| Nov 13, 2016 at 21:41 | comment | added | Brethlosze | Just at a glance, I am supposing you already have solutions on the simplest standard Basis Pursuit problem?: $$min |x|, Ax=y$$ or for this?: $$min \mu |x| + ||Ax-y||^2$$ and in the alternative form you exposed?: $$min |x|, ||ERx-y||<=\epsilon$$ Is your scope to propose a new solution of the BP Problem?, or to get solve it and resume your work?. Perhaps a paper reference on this form should be interesting to see. | |
| Sep 10, 2013 at 16:32 | comment | added | AnonSubmitter85 | @TomKealy I might be able to, but then what? I'm not looking for a basis and, unless I am forgetting something, orthogonalizing will change the system. | |
| Sep 4, 2013 at 9:33 | comment | added | Tom Kealy | Could you orthogonalise the rows via the Gram-Schmidt algorithm? | |
| Sep 3, 2013 at 18:16 | history | tweeted | twitter.com/#!/StackSignals/status/374959017388691456 | ||
| Sep 2, 2013 at 19:32 | review | First posts | |||
| Sep 8, 2013 at 11:06 | |||||
| Sep 2, 2013 at 19:13 | history | asked | AnonSubmitter85 | CC BY-SA 3.0 |