Explores KKT conditions in convex optimization, covering dual problems, logarithmic constraints, least squares, matrix functions, and suboptimality of covering ellipsoids.
Explores Sum of Squares polynomials and Semidefinite Programming in Polynomial Optimization, enabling the approximation of non-convex polynomials with convex SDP.
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.
