1.1k citations · 3.9k across the 74 of their papers we have counts for
Showing 2013 · cs.ITShow all
3 papers · 2 filters
cs.IT2013★ 38 cited
The achievable performance of convex demixing
Michael B. McCoy, Joel A. Tropp
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…
cs.IT2013★ 21 cited
Subadditivity of Matrix phi-Entropy and Concentration of Random Matrices
Joel A. Tropp, Richard Y. Chen
Matrix concentration inequalities provide a direct way to bound the typical spectral norm of a random matrix. The methods for establishing these results often parallel classical ar…
cs.IT2013★ 28 cited
Living on the edge: Phase transitions in convex programs with random data
Dennis Amelunxen, Martin Lotz, Michael B. McCoy +1
Recent research indicates that many convex optimization problems with random constraints exhibit a phase transition as the number of constraints increases. For example, this phenom…