Rounding sum-of-squares relaxations
Author(s)Barak, Boaz; Kelner, Jonathan Adam; Steurer, David
MetadataShow full item record
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof system to transform a combining algorithm---an algorithm that maps a distribution over solutions into a (possibly weaker) solution---into a rounding algorithm that maps a solution of the relaxation to a solution of the original problem.
DepartmentMassachusetts Institute of Technology. Department of Mathematics
Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC '14)
Association for Computing Machinery (ACM)
Boaz Barak, Jonathan A. Kelner, and David Steurer. 2014. Rounding sum-of-squares relaxations. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC '14). ACM, New York, NY, USA, 31-40.