Explores optimization methods, including convexity, gradient descent, and non-convex minimization, with examples like maximum likelihood estimation and ridge regression.
Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.
Explores Sum of Squares polynomials and Semidefinite Programming in Polynomial Optimization, enabling the approximation of non-convex polynomials with convex SDP.