Abstract
We study n×n completely positive matrices M on the boundary of the completely positive cone, namely those orthogonal to a copositive matrix S which generates a quadratic form with finitely many zeroes in the standard simplex. Constructing particular instances of S, we are able to construct counterexamples to the famous Drew-Johnson-Loewy conjecture (1994) for matrices of order seven through eleven.
Original language | English |
---|---|
Pages (from-to) | 208-221 |
Number of pages | 14 |
Journal | Linear Algebra and Its Applications |
Volume | 459 |
DOIs | |
Publication status | Published - 15 Oct 2014 |
Austrian Fields of Science 2012
- 101015 Operations research
Keywords
- Copositive optimization
- Completely positive matrices
- Cp-rank
- Nonnegative factorization
- Circular symmetry
- COPOSITIVE OPTIMIZATION