\0,1\ completely positive tensors and multi-hypergraphs
From MaRDI portal
Publication:501224
Abstract: Completely positive graphs have been employed to associate with completely positive matrices for characterizing the intrinsic zero patterns. As tensors have been widely recognized as a higher-order extension of matrices, the multi-hypergraph, regarded as a generalization of graphs, is then introduced to associate with tensors for the study of complete positivity. To describe the dependence of the corresponding zero pattern for a special type of completely positive tensors--the completely positive tensors, the completely positive multi-hypergraph is defined. By characterizing properties of the associated multi-hypergraph, we provide necessary and sufficient conditions for any associated tensor to be completely positive. Furthermore, a necessary and sufficient condition for a uniform multi-hypergraph to be completely positive multi-hypergraph is proposed as well.
Recommendations
- Hypergraph characterizations of copositive tensors
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- Totally positive matrices and totally positive hypergraphs
- The Laplacian tensor of a multi-hypergraph
- On \(\{0,1\}\) CP tensors and CP pseudographs
- Signed \(k\)-uniform hypergraphs and tensors
- On spectral hypergraph theory of the adjacency tensor
- Copositive tensor detection and its applications in physics and hypergraphs
- Tensor join of hypergraphs and its spectra
- Spectral theory of weighted hypergraphs via tensors
Cites work
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- Characterization of completely positive graphs
- Completely positive matrices and positivity of least squares solutions
- Completely positive matrices.
- Completely positive reformulations for polynomial optimization
- Essentially positive tensors
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors II
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
- Numerical optimization for symmetric tensor decomposition
- On eigenvalue problems of real symmetric tensors
- On spectral hypergraph theory of the adjacency tensor
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Perron-Frobenius theorem for nonnegative tensors
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Separating doubly nonnegative and completely positive matrices
- Symmetric nonnegative tensors and copositive tensors
- The CP-matrix completion problem
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Uniform and minimal {0,1} – cpmatrices
- \(\{0,1\}\) completely positive matrices
Cited in
(9)- On \(\{0,1\}\) CP tensors and CP pseudographs
- Dehomogenization for completely positive tensors
- Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering
- Completely positive tensor recovery with minimal nuclear value
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
- Completely positive binary tensors
- Some characterizations of \(M\)-tensors via digraphs
- Halos and undecidability of tensor stable positive maps
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
This page was built for publication: \(\{0,1\}\) completely positive tensors and multi-hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501224)
