A Necessary and Sufficient Condition for Generalized Demixing

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 also creates a way to estimate the probability of success by the approximate kinematic formula.