Generating polynomials and symmetric tensor decompositions

DOI10.1007/s10208-015-9291-7zbMath1381.15017arXiv1408.5664OpenAlexW2245131330MaRDI QIDQ2397746

Jia-Wang Nie

Publication date: 23 May 2017

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.5664

zbMATH Keywords

polynomial systemsymmetric tensorgenerating matrixtensor rankgenerating polynomialsymmetric tensor decomposition

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)

Related Items

Tensors in computations ⋮ Separability of Hermitian tensors and PSD decompositions ⋮ Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ The saddle point problem of polynomials ⋮ On the complexity of finding tensor ranks ⋮ A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors ⋮ Partially symmetric tensor structure preserving rank-\(R\) approximation via BFGS algorithm ⋮ Completely Positive Binary Tensors ⋮ Low Rank Symmetric Tensor Approximations ⋮ Completely positive tensors in the complex field ⋮ Symmetric Hermitian decomposability criterion, decomposition, and its applications ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ Loss functions for finite sets ⋮ Symmetric Tensor Nuclear Norms ⋮ Hankel Tensor Decompositions and Ranks ⋮ Hermitian Tensor Decompositions ⋮ Estimating Higher-Order Moments Using Symmetric Tensor Decomposition ⋮ On decompositions and approximations of conjugate partial-symmetric tensors ⋮ A semidefinite algorithm for completely positive tensor decomposition ⋮ Real eigenvalues of nonsymmetric tensors ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems ⋮ Rank-\(r\) decomposition of symmetric tensors ⋮ An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors ⋮ An efficient alternating minimization method for fourth degree polynomial optimization ⋮ Numerical optimization for symmetric tensor decomposition ⋮ Rank decomposition and symmetric rank decomposition over arbitrary fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvectors of tensors and algorithms for Waring decomposition
• Decomposition of homogeneous polynomials with low rank
• Recent advances in numerical methods for nonlinear equations and nonlinear least squares
• Symmetric tensor decomposition
• Computing symmetric rank for symmetric tensors
• On the rank of a binary form
• Decomposition of quantics in sums of powers of linear forms
• Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
• Moment matrices, border bases and real radical computation
• Flat extensions of positive moment matrices: recursively generated relations
• Solution of the truncated complex moment problem for flat data
• Symmetric Tensors and Symmetric Tensor Rank
• Most Tensor Problems Are NP-Hard
• Secant varieties to high degree Veronese reembeddings, catalecticant matrices and smoothable Gorenstein schemes