Over the past two decades, semidefinite programming and sum of squares methods have provided state-of-the-art results — both theoretical and practical -- for a variety of problems in many areas, including combinatorial optimization, systems and control, and statistical estimation. In this talk we’ll provide a gentle introduction and survey of basic notions, algorithmic techniques, and future challenges. Particular emphasis will be given to newer developments, and applications to probability theory and quantum information.