Linear mappings preserving the copositive cone
Abstract
Let Sn be the set of all n-by-n symmetric real matrices, and let Cn be the copositive cone, that is, the set of all matrices a∈Sn that fulfill the condition u a u≥slant0 for all n-vectors u with nonnegative entries. We prove that a linear mapping :Sn Sn satisfies (Cn)=Cn if and only if (x)=m xm for a fixed monomial matrix m with nonnegative entries.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.