The achievable performance of convex demixing

Abstract

Demixing is the problem of identifying multiple structured signals from a superimposed, undersampled, and noisy observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. When the constituent signals follow a generic incoherence model, this analysis leads to precise recovery guarantees. These results admit an attractive interpretation: each signal possesses an intrinsic degrees-of-freedom parameter, and demixing can succeed if and only if the dimension of the observation exceeds the total degrees of freedom present in the observation.

References in corpus (1)

• A framework to characterize performance of LASSO algorithms

Cited by in corpus (16)

• Sparse Signal Processing Concepts for Efficient 5G System Design
• A new perspective on least squares under convex constraint
• Beyond Low Rank + Sparse: Multi-scale Low Rank Matrix Decomposition
• Convexity in source separation: Models, geometry, and algorithms
• A Compressed Sensing Based Decomposition of Electrodermal Activity Signals
• Randomized Numerical Linear Algebra: Foundations & Algorithms
• Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging
• Regularized Gradient Descent: A Nonconvex Recipe for Fast Joint Blind Deconvolution and Demixing
• Gordon's inequality and condition numbers in conic optimization
• Low-complexity implementation of convex optimization-based phase retrieval
• Caulking the Leakage Effect in MEEG Source Connectivity Analysis
• Blind Demixing and Deconvolution at Near-Optimal Rate
• Exact matrix completion based on low rank Hankel structure in the Fourier domain
• Blind Demixing for Low-Latency Communication
• The Necessary And Sufficient Condition for Generalized Demixing
• Intersection probabilities and kinematic formulas for polyhedral cones