Robust Optimization: Polynomial Approximation & Uncertainty Sets

This lecture by the instructor covers robust optimization, focusing on polynomial approximation and uncertainty sets. It discusses the robust counterpart of uncertain optimization problems, sources of uncertainty, uncertainty sets, and robust linear programs. The lecture also explains the robust optimization trick for polyhedral and ellipsoidal uncertainty sets, providing insights into how to address the robust counterpart using standard solvers.