Perfect Copositive Matrices

DOI10.46298/CM.11141MaRDI QIDQ6509428arXivFDO

Authors Valentin Dannenberg, Achill Schürmann

Published in arXiv

Full work available at URL https://doi.org/10.46298/CM.11141

Mathematics Subject Classification ID

Minima of forms (11H50) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Quadratic programming (90C20)

Abstract: In this paper we give a first study of perfect copositive $nimesn$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive definite matrices. Most of the differences occur only for $ngeq3$, where we find for instance lower rank and indefinite perfect matrices. Nevertheless, we find for all $n$ that for every classical perfect matrix there is an arithmetically equivalent one which is also perfect copositive. Furthermore we study the neighborhood graph and polyhedral structure of perfect copositive matrices. As an application we obtain a new characterization of the cone of completely positive matrices: It is equal to the set of nonnegative matrices having a nonnegative inner product with all perfect copositive matrices.

This page was built for publication: Perfect Copositive Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509428)