## Rounding sum-of-squares relaxations

##### Author(s)

Barak, Boaz; Kelner, Jonathan Adam; Steurer, David
DownloadKelner_Rounding sum.pdf (481.8Kb)

OPEN_ACCESS_POLICY

# Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

##### Terms of use

##### Metadata

Show full item record##### 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.

##### Date issued

2014-05##### Department

Massachusetts Institute of Technology. Department of Mathematics##### 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

##### ISBN

978-1-4503-2710-7