estimation and learning algorithms are dramatically improving our capacity to extract information from massive datasets, with impressive consequences for technology and society at large. although these algorithms have had widespread empirical success, we have yet to find a coherent mathematical foundation that can explain why these algorithms succeed on such a wide array of problems. the challenge is that the two assumptions that underpin classical optimization theory---smoothness and convexity---rarely hold in contemporary settings. nonetheless, simple optimization algorithms often do succeed, and over the last few years, i have studied when and why this happens. in this talk, i will survey some recent work in this area covering optimization theory, algorithms, and applications in signal processing and machine learning. in the process, we will encounter a surprisingly rich array of mathematical tools spanning nonsmooth analysis, semi-algebraic geometry, and high dimensional probability and statistics.