Michael McCoy
Home

About me

I am a newly-minted Ph.D. with the Computing and Mathematical Sciences department at Caltech working with Joel Tropp. For more about my research interests, check out my Mendeley profile here.

News and updates

May 13, 2013: I successfully defended my Ph.D. thesis! The final copy will be available on this page soon.

March 26, 2013: Another one out: D. Amelunxen, M. Lotz, M.B. McCoy, and J.A. Tropp, Living on the edge: A geometric theory of phase transitions in convex optimization [arXiv:1303.6672]

May 8, 2012: Our deconvolution paper is available! M.B. McCoy and J.A. Tropp, Sharp bounds for convex deconvolution, with applications.. 2012. preprint.

February 23, 2012: Our newest paper is out in the wild! Check it out. 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.

September 14, 2011: Our paper "Two Proposals for Robust PCA using Semidefinite Programming" will appear in the Electronic Journal of Statistics (open-access).

August 11, 2011: I've updated my robust PCA code to reflect a revision in the paper. See here.

June 27---30, 2011: I'm attending SPARS'11 in Edinburgh, Scotland, where I'm presenting a talk titled "Two Proposals for Robust PCA" based on the pre-print here. The code associated with our work is here, and the slides are available here.

June 15, 2011: I've had to migrate this website to the new CMS server, as the old ACM department is no more. Please let me know if you find any broken links or other issues.

September 13-December 17, 2010: I'm spending much of my time at UCLA for the Modern Trends in Optimization and Its Application workshop.

June 7, 2010: Added a section about teaching since a couple of us are running a self-taught algebraic geometry course.

April 5, 2010: I added a makefile for LaTeX files to my code directory that I've been using for some time in case anyone else finds it useful.

March 18, 2010: I have uploaded a tar.gz file containing a Matlab implementation of the CoSaMP algorithm for compressed sensing. See the code directory for more details.

Jan. 29, 2010: I gave a talk on the maxcut semidefinite relaxation of Goemans and Williamson titled "Relax and Do Something Random" at the ACM^T hour.


Last Modified: Thursday, 16-May-2013 20:33:49 PDT

Valid HTML 4.01 Transitional