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 Mediaspace

Official source

https://mediaspace.epfl.ch/media/0_akpez2bo

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.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.