Algebraic Techniques and Semidefinite Optimization

Discriminant for a fourth-order polynomial. Inside region is nonnegative.

The discriminant of the polynomial x4 + 4ax3 + 6bx2 + 4cx + 1. The convex set inside the "bowl" corresponds to the region of nonnegativity. There is an additional one-dimensional component inside the set. (Image courtesy of Prof. Pablo Parrilo.)


MIT Course Number


As Taught In

Spring 2006



Cite This Course

Course Description

Course Features

Course Description

This research-oriented course will focus on algebraic and computational techniques for optimization problems involving polynomial equations and inequalities with particular emphasis on the connections with semidefinite optimization. The course will develop in a parallel fashion several algebraic and numerical approaches to polynomial systems, with a view towards methods that simultaneously incorporate both elements. We will study both the complex and real cases, developing techniques of general applicability, and stressing convexity-based ideas, complexity results, and efficient implementations. Although we will use examples from several engineering areas, particular emphasis will be given to those arising from systems and control applications.

Related Content

Pablo Parrilo. 6.972 Algebraic Techniques and Semidefinite Optimization. Spring 2006. Massachusetts Institute of Technology: MIT OpenCourseWare, License: Creative Commons BY-NC-SA.

For more information about using these materials and the Creative Commons license, see our Terms of Use.