Copositive matrices, sums of squares and the stability number of a graph

2023/02/09 by Luis Felipe Vargas, Vargas, Luis Felipe, Monique Laurent +1
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #FOS: Mathematics #Matrix Theory and Algorithms #Optimization and Control (math.OC)

paper · pdf · doi:10.48550/arxiv.2302.04690

openalex publication_date 2023/02/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30

Abstract

This chapter investigates the cone of copositive matrices, with a focus on the design and analysis of conic inner approximations for it. These approximations are based on various sufficient conditions for matrix copositivity, relying on positivity certificates in terms of sums of squares of polynomials. Their application to the discrete optimization problem asking for a maximum stable set in a graph is also discussed. A central theme in this chapter is understanding when the conic approximations suffice for describing the full copositive cone, and when the corresponding bounds for the stable set problem admit finite convergence.

Related

• Low degree sum-of-squares bounds for the stability number: a copositive approach
• Exactness of Parrilo's conic approximations for copositive matrices and associated low order bounds for the stability number of a graph
• New approximations for the cone of copositive matrices and its dual
• On the Exactness of Sum-of-Squares Approximations for the Cone of 5× 5 Copositive Matrices
• On equivalent representations and properties of faces of the cone of copositive matrice