2000 character limit reached
Convergence of SDP hierarchies for polynomial optimization on the hypersphere (1210.5048v2)
Published 18 Oct 2012 in math.OC, cs.DS, math-ph, math.MP, and quant-ph
Abstract: We show how to bound the accuracy of a family of semi-definite programming relaxations for the problem of polynomial optimization on the hypersphere. Our method is inspired by a set of results from quantum information known as quantum de Finetti theorems. In particular, we prove a de Finetti theorem for a special class of real symmetric matrices to establish the existence of approximate representing measures for moment matrix relaxations.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.