(home)

Separation polynomials and SDP optimization

Last spring, I took Pablo Parrilo's semidefinite programming course and got to dive really deep into polynomial optimization. One of the things that piqued my interest was generalizing separating hyperplanes to separating polynomials. I've already written about how the SOS hierarchy generalizes the Lagrangian. The separating hyperplane story is, in a sense, the same story from a different perspective. After all, separation implies optimization.