Approximating the cone of copositive kernels to estimate the stability number of infinite graphs

Olga Kuryatnikova, Juan Vera Lizcano

Research output: Contribution to journalArticleScientificpeer-review

Abstract

It has been shown that the stable set problem in an infinite compact graph, and particularly the kissing number problem, reduces to an optimization problem over the cone of copositive kernels. We propose two converging hierarchies approximating this cone. Both are extensions of existing inner hierarchies for the finite dimensional copositive cone. We implement the first two levels of the new hierarchies for the kissing number problem.
Original languageEnglish
Pages (from-to)303-308
JournalElectronic Notes in Discrete Mathematics
Volume62
DOIs
Publication statusPublished - Nov 2017

Keywords

  • copositive programming
  • semi-definite approximations
  • lifting
  • kissing number

Fingerprint Dive into the research topics of 'Approximating the cone of copositive kernels to estimate the stability number of infinite graphs'. Together they form a unique fingerprint.

  • Cite this