On the cp-rank and minimal cp factorizations of a completely positive matrix
From MaRDI portal
(Redirected from Publication:2848616)
Recommendations
Cited in
(41)- On the computation of \(C^*\) certificates
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Building a completely positive factorization
- Completely positive cones: are they facially exposed?
- The maximal cp-rank of rank k completely positive matrices
- CP rank of completely positive matrices of order 5
- Completely positive matrices: real, rational, and integral
- The extreme rays of the \(6\times 6\) copositive cone
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Completely positive matrices over Boolean algebras and their CP-rank
- Completely positive completely positive maps (and a resource theory for non-negativity of quantum amplitudes)
- The DJL conjecture for CP matrices over special inclines
- Semialgebraic geometry of nonnegative tensor rank
- Completely positive rooted matrices
- New results on the cp-rank and related properties of co(mpletely) positive matrices
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- scientific article; zbMATH DE number 5613138 (Why is no real title available?)
- Matrices with high completely positive semidefinite rank
- New lower bounds and asymptotics for the cp-rank
- From seven to eleven: completely positive matrices with high cp-rank
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- Extremal copositive matrices with zero supports of cardinality n-2
- Extremal copositive matrices with minimal zero supports of cardinality two
- The structure of completely positive matrices according to their CP-rank and CP-plus-rank
- Lower bounds for maximal cp-ranks of completely positive matrices and tensors
- Faces of the 5 5 completely positive cone
- The Drew-Johnson-Loewy conjecture for matrices over max-min semirings
- On the DJL conjecture for order 6
- Uniform and minimal {0,1} – cpmatrices
- Bounding the CP-rank by graph parameters
- On the number of CP factorizations of a completely positive matrix
- Preservers of the cp-rank
- Approximate completely positive semidefinite factorizations and their ranks
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
- The cone of 5 5 completely positive matrices
- A projected inexact Levenberg-Marquardt method for the completely positive matrix factorization
- On dimensions of maximal faces of completely positive cones
- A square departure from symmetry in matrix cones
- Matrix factorization ranks via polynomial optimization
- A note on the computation of the CP-rank
- Interiors of completely positive cones
This page was built for publication: On the cp-rank and minimal cp factorizations of a completely positive matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848616)