SPN completable graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3176168 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- Characterization of completely positive graphs
- Combinatorial results on completely positive matrices
- Complete positivity
- Extensions of band matrices with band inverses
- Graph theory
- Irreducible elements of the copositive cone
- Nonnegative factorization of positive semidefinite nonnegative matrices
- On copositive matrices with -1, 9, 1 entries
- On the Matrix Equation X′X = A
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Positive definite completions of partial Hermitian matrices
- The completely positive and doubly nonnegative completion problems
- The copositive completion problem
- The copositive completion problem: unspecified diagonal entries
- Two remarks on copositive matrices
Cited in
(6)
This page was built for publication: SPN completable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269250)