On \(\{0,1\}\) CP tensors and CP pseudographs
From MaRDI portal
Publication:1790471
DOI10.1016/j.laa.2018.08.001zbMath1397.53020arXiv1611.09206OpenAlexW2887499700WikidataQ114152332 ScholiaQ114152332MaRDI QIDQ1790471
Changqing Xu, Liqun Qi, Zhibing Chen
Publication date: 2 October 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.09206
Differential geometric aspects in vector and tensor analysis (53A45) Multilinear algebra, tensor calculus (15A69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Symmetric nonnegative tensors and copositive tensors
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs
- Characterization of completely positive graphs
- On spectral hypergraph theory of the adjacency tensor
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Nonnegative factorization of positive semidefinite nonnegative matrices
- Completely positive matrices and positivity of least squares solutions
- Completely positive matrices.
- \(\{0,1\}\) completely positive matrices
- Separating doubly nonnegative and completely positive matrices
- Numerical optimization for symmetric tensor decomposition
- Completely positive reformulations for polynomial optimization
- Positivities of Vandermonde tensors
- Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations
- Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
- Eigenvalues of the adjacency tensor on products of hypergraphs
- Uniform and minimal {0,1} – cpmatrices