Convex Analysis and Optimization III

4 credits

Convex optimization problems, linear matrix inequalities, second-order cone programming, semidefinite programming, sum of squares of polynomials, positive polynomials, distance geometry. Prerequisites: MATH 245B or consent of instructor.