This lecture covers the concept of Sum of Squares (SOS) polynomials and Semidefinite Programming (SDP) in the context of Polynomial Optimization. It explains how to determine if a polynomial is SOS, the proof behind it, and how to approximate non-convex polynomials using convex SDP. The lecture also discusses the relationship between polynomials, symmetric matrices, and SDP constraints.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace