Linear mappings preserving the copositive cone
Preprint
Abstract
Let $\mathcal{S}_n$ be the set of all $n$-by-$n$ symmetric real matrices, and let $\mathcal{C}_n$ be the copositive cone, that is, the set of all matrices $a\in\mathcal{S}_n$ that fulfill the condition $u^\top a u\geqslant0$ for all $n$-vectors $u$ with nonnegative entries. We prove that a linear mapping $\varphi:\mathcal{S}_n\to \mathcal{S}_n$ satisfies $\varphi(\mathcal{C}_n)=\mathcal{C}_n$ if and only if $$\varphi(x)=m^\top xm$$ for a fixed monomial matrix $m$ with nonnegative entries.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Linear preservers of copositive matricesLinear and Multilinear Algebra, 2019
- Open problems in the theory of completely positive and copositive matricesThe Electronic Journal of Linear Algebra, 2015
- On the computational complexity of membership problems for the completely positive cone and its dualComputational Optimization and Applications, 2013
- A Variational Approach to Copositive MatricesSIAM Review, 2010
- Some general techniques on linear preserver problemsLinear Algebra and its Applications, 2000
- Linear preserver problems: A brief introduction and some special techniquesLinear Algebra and its Applications, 1992
- Criteria for copositive matricesLinear Algebra and its Applications, 1986