i will present a new method to analyze and design iterative optimization algorithms, built on the framework of integral quadratic constraints (iqc) from robust control theory. iqcs provide sufficient conditions for the stability of complicated interconnected systems, and these conditions can be checked by semidefinite programming. i will discuss how to adapt iqc theory to study optimization algorithms, proving new inequalities about convex functions. using these inequalities, i will derive upper bounds on convergence rates for the gradient method, the heavy-ball method, nesterov's accelerated method, and related variants by solving small, simple semidefinite programs. i will close with a discussion of how these techniques can be used to search for algorithms with desired performance characteristics, establishing a new methodology for algorithm design.