6.256 Algebraic Techniques and Semidefinite Optimization


Class Info

Theory and computational techniques for optimization problems involving polynomial equations and inequalities with particular, emphasis on the connections with semidefinite optimization. Develops algebraic and numerical approaches of general applicability, with a view towards methods that simultaneously incorporate both elements, stressing convexity-based ideas, complexity results, and efficient implementations. Examples from several engineering areas, in particular systems and control applications. Topics include semidefinite programming, resultants/discriminants, hyperbolic polynomials, Groebner bases, quantifier elimination, and sum of squares.

This class has 6.251, and 15.093 as prerequisites.

6.256 will be offered this semester (Spring 2019). It is instructed by P. Parrilo.

Lecture occurs 1:00 PM to 2:30 PM on Wednesdays and Fridays in 56-154.

This class counts for a total of 12 credits.

You can find more information at the MIT + 6.256 - Google Search site or on the 6.256 Stellar site.

Recommended Textbooks
Save up to a ton by purchasing through MIT Textbooks!
MIT 6.256 Algebraic Techniques and Semidefinite Optimization Related Textbooks
MIT 6.256 Algebraic Techniques and Semidefinite Optimization On The Web
MIT + 6.256 - Google Search

© Copyright 2015