Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Polynomial Optimization: SOS and SDP
Description
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 MediaspaceOfficial source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.