Sharp Recovery Bounds for Convex Demixing, with Applications

Demixing refers to the challenge of identifying two structured signals given only the sum of the two signals and prior information about their structures. Examples include the problem of separating a signal that is sparse with respect to one basis from a signal that is sparse with respect to a secon...

Full description

Saved in:

Bibliographic Details
Published in:	Foundations of computational mathematics Vol. 14; no. 3; pp. 503 - 567
Main Authors:	McCoy, Michael B., Tropp, Joel A.
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.06.2014 Springer Nature B.V
Subjects:	Applications of Mathematics Complexity Computer Science Decoding Demixing Economics Empirical analysis Foundations Linear and Multilinear Algebras Math Applications in Computer Science Mathematical models Mathematics Mathematics and Statistics Matrix Matrix Theory Numerical Analysis Optimization Signal processing Statistics Integral geometry 60D05 Demixing Sparsity Convex optimization 52B55 52A22 (primary) 94B75 (secondary)
ISSN:	1615-3375, 1615-3383
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!