6.256 Algebraic Techniques and Semidefinite Optimization
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.
6.256 will not be offered this semester. It will be available in the Spring semester, and will be instructed by P. Parrilo.
This class counts for a total of 12 credits. This is a graduate-level class.
You can find more information at the http://www.google.com/search?&q=MIT+%2B+6.256&btnG=Google+Search&inurl=https site.
© Copyright 2015 Yasyf Mohamedali