Low Rank Symmetric Tensor Approximations

DOI10.1137/16M1107528zbMath1379.65025arXiv1709.01964OpenAlexW2964053826MaRDI QIDQ4598341

Jia-Wang Nie

Publication date: 20 December 2017

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

least squaressymmetric tensortensor decompositiontensor ranklow rank approximationgenerating polynomial

Mathematics Subject Classification ID

Related Items (7)

Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ Approximate real symmetric tensor rank ⋮ Symmetric Hermitian decomposability criterion, decomposition, and its applications ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ Loss functions for finite sets ⋮ Hankel Tensor Decompositions and Ranks ⋮ Riemannian Newton optimization methods for the symmetric tensor approximation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Eigenvectors of tensors and algorithms for Waring decomposition
• Decomposition of homogeneous polynomials with low rank
• The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
• Recent advances in numerical methods for nonlinear equations and nonlinear least squares
• Symmetric tensor decomposition
• Computing symmetric rank for symmetric tensors
• Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
• General tensor decomposition, moment matrices and applications
• Identifiability of homogeneous polynomials and Cremona transformations
• Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
• Numerical optimization for symmetric tensor decomposition
• Generating polynomials and symmetric tensor decompositions
• Rank-One Approximation to High Order Tensors
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• Remarks on the Symmetric Rank of Symmetric Tensors
• Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
• A literature survey of low-rank tensor approximation techniques
• Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
• Tensor decompositions for learning latent variable models
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• Low-Rank Approximation of Tensors
• On generic identifiability of symmetric tensors of subgeneric rank
• A Decomposition for Three-Way Arrays
• Nonlocal Perturbation Analysis of the Schur System of a Matrix
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Perturbation Bounds for the Generalized Schur Decomposition
• The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Symmetric Tensors and Symmetric Tensor Rank
• Most Tensor Problems Are NP-Hard

This page was built for publication: Low Rank Symmetric Tensor Approximations