Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations
DOI10.1137/15M1025220zbMath1349.15026OpenAlexW2552988668MaRDI QIDQ2834695
Publication date: 23 November 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1025220
completely positive tensorssum-of-squares tensorscompletely positive Vandermonde decompositiondoubly nonnegative tensorsLehmer tensorspositive Cauchy tensors
Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Multilinear algebra, tensor calculus (15A69)
Related Items (18)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- SOS tensor decomposition: theory and applications
- Symmetric nonnegative tensors and copositive tensors
- Copositive optimization -- recent developments and applications
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
- \(MB\)-tensors and \(MB_0\)-tensors
- Further results on Cauchy tensors and Hankel tensors
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Mean matrices and infinite divisibility
- The linear algebra of the Pascal matrix
- How bad are Hankel matrices?
- Separating doubly nonnegative and completely positive matrices
- Linear operators and positive semidefiniteness of symmetric tensor spaces
- Hankel tensors: associated Hankel matrices and Vandermonde decomposition
- Some properties of strong \(\mathcal{H}\)-tensors and general \(\mathcal{H}\)-tensors
- Numerical optimization for symmetric tensor decomposition
- Completely positive reformulations for polynomial optimization
- Positive definiteness and semi-definiteness of even order symmetric Cauchy tensors
- Circulant tensors with applications to spectral hypergraph theory and stochastic process
- \(M\)-tensors and nonsingular \(M\)-tensors
- Infinite and finite dimensional Hilbert tensors
- Conditioning and accurate computations with Pascal matrices
- Eigenvalues of a real supersymmetric tensor
- Global Optimization with Polynomials and the Problem of Moments
- Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone
- $M$-Tensors and Some Applications
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors
- The Evaluation of Matrix Inversion Programs
- Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
- Infinitely Divisible Matrices
This page was built for publication: Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations