Georgia Institute of Technology College of Sciences

In this talk I will discuss a particular convex relaxation of quadratic programs called the Shor relaxation. We study the Shor relaxation of quadratic programs by fixing a feasible set and considering the space of objective functions for which the Shor relaxation is exact. I will discuss conditions under which this region is invariant under the choice of generators defining the feasible set as well as how this region reflects the symmetry in the feasible region. Finally, I will discuss applications of these results to quadratic binary programs. This is joint work with Jose Rodriguez.