M. McCoy and J.A. Tropp, Two Proposals for Robust PCA Using Semidefinite Programming;. Elec. J. Stat. (5) 2011, 1123—1160.
D. Amelunxen, M. Lotz, M.B. McCoy, and J.A. Tropp, Living on the edge: A geometric theory of phase transitions in convex optimization, 2013. preprint arXiv:1303.6672
M.B. McCoy and J.A. Tropp, Sharp bounds for convex deconvolution, with applications, 2012. preprint. arXiv:1205.1580
G. Lerman, M. McCoy, J.A. Tropp, and T. Zhang, Robust computation of linear models, or How to find a needle in a haystack, 2012. preprint.
Talks and posters
"Convex Deconvolution: Sharp thresholds for rcovering superimposed signals" Poster presented at the CJR conference, June 4-6, 2012.
"Random geometry meets data analysis: Sharp recovery bounds for convex deconvolution" Talk given at the Princeton IDeAS Seminar, April 19, 2012. (Joint work with Joel A. Tropp.)
"Two Proposals for Robust PCA Using Semidefinite Programming" Slides presented at SPARS'11. Edinburgh, Scotland, June 27-30, 2011.
"Relax and Do Something Random: The MAXCUT Approximation of Goemans and Williamson" Presentation for the ACM^T hour on January 29, 2010.