Interior points of the completely positive cone.

By Mirjam Dür, Georg J. Still. 2008

65 citations recorded by the source corpus.

A matrix A is called completely positive if it can be decomposed as A = BB^T with an entrywise nonnegative matrix B. The set of all such matrices is a convex cone. We provide a characterization of the interior of this cone as well as of its dual.

Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/fd692e2af1a34e004bcd0fb82b7b1ff93404abf1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Peter J. C. Dickinson
2. Mirjam Dür
3. Roland Hildebrand

In Electrical and Electronic Engineering

1. Peter J. C. Dickinson
2. Mirjam Dür
3. Roland Hildebrand

In Numerical Analysis

1. Peter J. C. Dickinson
2. Mirjam Dür
3. Roland Hildebrand

Citations in the corpus

• Copositive Programming – a Survey (2010, background): “The interior of the completely positive cone has first been characterized in [27].”
• AN IMPROVED CHARACTERISATION OF THE INTERIOR OF THE COMPLETELY POSITIVE CONE (2010, background): “From a paper by Dür and Still [8], we have that int(C∗) = { AAT | A = [A1|A2] with A1 > 0 nonsingular, A2 ≥ 0 } .”