Rounding sum-of-squares relaxations

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 tha...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí: Barak, Boaz, Kelner, Jonathan Adam, Steurer, David
Rannpháirtithe: Massachusetts Institute of Technology. Department of Mathematics
Formáid: Alt
Teanga:en_US
Foilsithe / Cruthaithe: Association for Computing Machinery (ACM) 2015
Rochtain ar líne:http://hdl.handle.net/1721.1/93083
https://orcid.org/0000-0002-4257-4198