The cone of 5× 5 completely positive matrices

08/26/2021
by   Max Pfeffer, et al.
0

We study the cone of completely positive (cp) matrices for the first interesting case n = 5. This is a semialgebraic set, which means that the polynomial equalities and inequlities that define its boundary can be derived. We characterize the different loci of this boundary and we examine the two open sets with cp-rank 5 or 6. A numerical algorithm is presented that is fast and able to compute the cp-factorization even for matrices in the boundary. With our results, many new example cases can be produced and several insightful numerical experiments are performed that illustrate the difficulty of the cp-factorization problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2020

CP Degeneracy in Tensor Regression

Tensor linear regression is an important and useful tool for analyzing t...
research
04/08/2022

On computing the symplectic LL^T factorization

We analyze two algorithms for computing the symplectic LL^T factorizatio...
research
05/28/2020

Cats climb entails mammals move: preserving hyponymy in compositional distributional semantics

To give vector-based representations of meaning more structure, one appr...
research
05/03/2022

On the Utility of Prediction Sets in Human-AI Teams

Research on human-AI teams usually provides experts with a single label,...
research
06/13/2016

The Crossover Process: Learnability and Data Protection from Inference Attacks

It is usual to consider data protection and learnability as conflicting ...
research
12/01/2014

Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas

Canonical (logic) programs (CP) refer to normal logic programs augmented...
research
08/31/2016

Measuring the Quality of Exercises

This work explores the problem of exercise quality measurement since it ...

Please sign up or login with your details

Forgot password? Click here to reset