Related papers: Perfect Copositive Matrices
N-matrices are real $n\times n$ matrices all of whose principal minors are negative. We provide (i) an $O(2^n)$ test to detect whether or not a given matrix is an N-matrix, and (ii) a characterization of N-matrices, leading to the recursive…
A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a…
A square matrix $A$ is completely positive if $A=BB^T$, where $B$ is a (not necessarily square) nonnegative matrix. In general, a completely positive matrix may have many, even infinitely many, such CP factorizations. But in some cases a…
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…
In this paper we discuss copositive tensors, which are a natural generalization of the copositive matrices. We present an analysis of some basic properties of copositive tensors; as well as the conditions under which class of copositive…
We generalize Voronoi's theory of perfect quadratic forms to generalized copositive matrices over a closed convex and full-dimensional cone K. We introduce a notion of a K-copositive minimum and of perfect K-copositive matrices. We consider…
The problem of finding completely positive matrices with equal cp-rank and rank is considered. We give some easy-to-check sufficient conditions on the entries of a doubly nonnegative matrix for it to be completely positive with equal…
A symmetric matrix $C$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $C=BB^T$. The CP-completion problem is to study whether we can assign values to the missing entries of a partial matrix (i.e.,…
The dual of a matrix ordered space has a natural matrix ordering that makes the dual space matrix ordered as well. The purpose of these notes is to give a condition that describes when the linear map taking a basis of the n by n matrices to…
The objective of this manuscript is to understand the structure of an invertible linear map on the space of real symmetric matrices $\mathcal{S}^n$ that leaves invariant the closed convex cones of copositive and completely positive matrices…
The main question we raise here is the following one: given a real orthogonal n by n matrix X, is it true that there exists a rational orthogonal matrix Y having the same zero-pattern? We conjecture that this is the case and prove it for…
In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.…
A positive definite completion problem pertains to determining whether the unspecified positions of a partial (or incomplete) matrix can be completed in a desired subclass of positive definite matrices. In this paper we study an important…
An alternative, geometrical proof of a known theorem concerning the decomposition of positive maps of the matrix algebra $M_{2}(\mathbb{C})$ has been presented. The premise of the proof is the identification of positive maps with operators…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
It is proven that a certain class of positive maps in the matrix algebra $M_n$ consists of optimal maps, i.e. maps from which one cannot subtract any completely positive map without loosing positivity. This class provides a generalization…
We provide a decomposition that is sufficient in showing when a symmetric tridiagonal matrix $A$ is completely positive. Our decomposition can be applied to a wide range of matrices. We give alternate proofs for a number of related results…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…