Sharp recovery bounds for convex demixing, with applications (Q404302): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CVX / rank | |||
Normal rank | |||
Revision as of 04:06, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp recovery bounds for convex demixing, with applications |
scientific article |
Statements
Sharp recovery bounds for convex demixing, with applications (English)
0 references
4 September 2014
0 references
In modern data-intensive science, it is common to observe a superposition of multiple information-bearing signals. Demixing refers to the challenge of separating out the constituent signals from the observation. This work presents a general framework for demixing based on convex optimization. The authors study the geometry of the optimization problem and they develop conditions that describe precisely when this method succeeds.
0 references
demixing
0 references
sparsity
0 references
integral geometry
0 references
convex optimization
0 references
