Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph
DOI10.1287/moor.2022.1290arXiv2109.12876WikidataQ114058146 ScholiaQ114058146MaRDI QIDQ6199282
Monique Laurent, Luis Felipe Vargas
Publication date: 23 February 2024
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.12876
semidefinite programmingcopositive matrixpolynomial optimizationstable set problemsum-of-squares polynomial\(\alpha\)-critical graphShor relaxation
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Sums of squares and representations by other particular quadratic forms (11E25) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Polynomial optimization (90C23)
This page was built for publication: Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph