The Necessary And Sufficient Condition for Generalized Demixing
arXiv:1503.08286 · doi:10.1109/LSP.2015.2457403
Abstract
Demixing is the problem of identifying multiple structured signals from a superimposed observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. We present a new solution to determine whether or not a specific convex optimization problem built for generalized demixing is successful. This solution will also bring about the possibility to estimate the probability of success by the approximate kinematic formula.