This lecture by the instructor covers the topic of polynomial optimization, focusing on writing polynomials as matrix products and solving linear equations to ensure nonnegativity. It also discusses the approximation of non-convex polynomials by solving convex SDPs, as well as key concepts such as robust optimization, uncertainty sets, and robust linear programs.
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