A very brief introduction to nonnegative tensors from the geometric viewpoint
From MaRDI portal
Publication:1634685
DOI10.3390/math6110230zbMath1405.15033OpenAlexW2898750744WikidataQ114028047 ScholiaQ114028047MaRDI QIDQ1634685
Publication date: 18 December 2018
Published in: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/math6110230
EM algorithmspectral theorylow-rank approximationssemialgebraic geometrynonnegative tensorsuniqueness and identifiability
Differential geometric aspects in vector and tensor analysis (53A45) Multilinear algebra, tensor calculus (15A69)
Related Items (2)
Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple ⋮ On large-scale dynamic topic modeling with nonnegative CP tensor decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- E-characteristic polynomials of tensors
- Eigenvectors of tensors and algorithms for Waring decomposition
- Refined methods for the identifiability of tensors
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
- Symmetric tensor decomposition
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- Eigenvalues and invariants of tensors
- Perron-Frobenius theorem for nonnegative tensors
- On uniqueness conditions for Candecomp/Parafac and Indscal with full column rank in one mode
- Rank and optimal computation of generic tensors
- Typical tensorial rank
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- The number of eigenvalues of a tensor
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- Partial tensor decomposition for decoupling isogeometric Galerkin discretizations
- Low rank tensor methods in Galerkin-based isogeometric analysis
- Fixed points of the EM algorithm and nonnegative rank boundaries
- Tensors of nonnegative rank two
- Optimal quadrature rules for odd-degree spline spaces and their application to tensor-product-based isogeometric analysis
- Algebraic geometry of Bayesian networks
- Eigenvalues of a real supersymmetric tensor
- On the weak non-defectivity of Veronese embeddings of projective spaces
- Some approximation problems in semi-algebraic geometry
- Semialgebraic Geometry of Nonnegative Tensor Rank
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
- On Generic Nonexistence of the Schmidt--Eckart--Young Decomposition for Complex Tensors
- A survey on the spectral theory of nonnegative tensors
- The average number of critical rank-one approximations to a tensor
- On generic identifiability of symmetric tensors of subgeneric rank
- Uniqueness of Nonnegative Tensor Approximations
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors
- Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
- Singularities of linear systems and the Waring problem
- Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL
- On the Complexity of Nonnegative Matrix Factorization
- Induction for secant varieties of Segre varieties
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
- Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
- Using Algebraic Geometry
- On Generic Identifiability of 3-Tensors of Small Rank
- An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors
- Symmetric Tensors and Symmetric Tensor Rank
- Bayesian Factorizations of Big Sparse Tensors
- Most Tensor Problems Are NP-Hard
- Computing a nonnegative matrix factorization -- provably
- ON THE CONCEPT OF k-SECANT ORDER OF A VARIETY
- Computing non-negative tensor factorizations
- Algebraic Statistics for Computational Biology
- The Expected Number of Eigenvalues of a Real Gaussian Tensor
- Über homogene Polynome in ($L^{2}$)
- Graphical models
- Subtracting a best rank-1 approximation may increase tensor rank
- The Euclidean distance degree of an algebraic variety
This page was built for publication: A very brief introduction to nonnegative tensors from the geometric viewpoint