Joseph Woodworth


Office :             IPAM 1129

E-Mail :            jwoodworth at


  I am a student in the mathematics PhD program at UCLA who began in the Fall of 2011 after completing my BS in mathematics from the University of Maryland, College Park in the spring of 2011.  I was an NSF Graduate Research Fellow and I am currently a Girsky Fellow.  I passed the UCLA applied mathematics qualifying exams in the Spring of 2012 and advanced to candidacy in the fall of 2013.


phD Candidate

University of California, Los Angeles, Department of Mathematics

Research Interests

PDEs, nonlocal operators, image processing,  density estimation,  networks, dictionary learning, compressed sensing, optimization

Publications and Submissions

  1. -M. Cucuringu, J. Woodworth, Point Localization and Density Estimation from Ordinal kNN graphs using Synchronization

  2. -Cucuringu, Mihai, and Joseph Woodworth, Ordinal embedding of unweighted kNN graphs via synchronization, Machine Learning for Signal Processing (MLSP), 2015 IEEE 25th International Workshop on, 2015.

  3. -J. Woodworth, R. Chartrand, Compressed Sensing Recovery via Nonconvex Shrinkage Penalties, submitted

  4. -J. T. Woodworth, G. O. Mohler, A. L. Bertozzi and P. J. Brantingham, Nonlocal Crime Density Estimation Incorporating Housing Information, Phil. Trans. Roy. Soc. A 2014 372 20130403; DOI: 10.1098/rsta.2013.0403 Published 6 October 2014

  5. -J. Benedetto, R. Benedetto, J. Woodworth Optimal ambiguity functions and Weil’s exponential sum bound, Journal of Fourier Analysis and Applications, June 2012 Vol. 18 Issue 3 pp 471-487

Don’t be satisfied with low-hanging fruit