### Abstract

In this article, we introduce a new method of certifying any copositive matrix to be copositive. This is done through the use of a theorem by Hadeler and the Farkas Lemma. For a given copositive matrix this certificate is constructed by solving finitely many linear systems, and can be subsequently checked by checking finitely many linear inequalities. In some cases, this certificate can be relatively small, even when the matrix generates an extreme ray of the copositive cone which is not positive semidefinite plus nonnegative. This certificate can also be used to generate the set of minimal zeros of a copositive matrix. In the final section of this paper we introduce a set of newly discovered extremal copositive matrices.

Original language | English |
---|---|

Pages (from-to) | 15-37 |

Number of pages | 23 |

Journal | Linear algebra and its applications |

Volume | 569 |

DOIs | |

Publication status | Published - 15 May 2019 |

### Keywords

- Copositive matrix
- NP-hard
- Certificate
- Minimal zeros
- Extreme ray

## Fingerprint Dive into the research topics of 'A new certificate for copositivity'. Together they form a unique fingerprint.

## Cite this

Dickinson, P. J. C. (2019). A new certificate for copositivity.

*Linear algebra and its applications*,*569*, 15-37. https://doi.org/10.1016/j.laa.2018.12.025