Rounding sum-of-squares relaxations
Name
Kelner_Rounding sum.pdf
Size
481.81 KB
Format
Adobe PDF
Checksum (MD5)
96659437d5afb83262d868f0ca25e05c
Author(s)
Barak, Boaz
Kelner, Jonathan Adam
Steurer, David
Date Issued
May 2014
Journal
Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC '14)
Publisher
Association for Computing Machinery (ACM)
Citation
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.
Version
Original manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2591796.2591886
