On the Exactness of Sum-of-Squares Approximations for the Cone of $5\times 5$ Copositive Matrices
Monique Laurent, Luis Felipe Vargas

TL;DR
This paper examines the hierarchy of sum-of-squares-based inner approximations for the 5x5 copositive cone, establishing conditions for their exactness and introducing new approximation cones based on polynomial sums of squares.
Contribution
It introduces new Lasserre-type inner approximations for the copositive cone and characterizes when the hierarchy of sum-of-squares approximations is exact for 5x5 matrices.
Findings
Equality holds iff all positive diagonal scalings of the Horn matrix are in the hierarchy.
Introduces new polynomial-based inner approximation cones.
Uses finite convergence of Lasserre hierarchy to determine membership.
Abstract
We investigate the hierarchy of conic inner approximations () for the copositive cone , introduced by Parrilo (Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, PhD Thesis, California Institute of Technology, 2001). It is known that and that, while the union of the cones covers the interior of , it does not cover the full cone if . Here we investigate the remaining case , where all extreme rays have been fully characterized by Hildebrand (The extreme rays of the 5 5 copositive cone. Linear Algebra and its Applications, 437(7):1538--1547, 2012). We show that the Horn matrix and its positive diagonal scalings play an exceptional role among the extreme rays of .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Matrix Theory and Algorithms · Polynomial and algebraic computation
