On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors
From MaRDI portal
Publication:311692
DOI10.1016/j.aml.2016.06.006zbMath1348.65088OpenAlexW2429756633MaRDI QIDQ311692
Pierre Comon, Alex P. da Silva, André L. F. de Almeida
Publication date: 13 September 2016
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2016.06.006
alternating least squares algorithmbest rank-1 three-way tensor approximationgeneral quadratic multivariate systemquadratic polynomials equations
Numerical computation of solutions to systems of equations (65H10) Numerical computation of roots of polynomial equations (65H04)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Symmetric tensor decomposition
- Border basis relaxation for polynomial optimization
- Semidefinite programming relaxations for semialgebraic problems
- Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
- Applications of Gröbner bases to signal and image processing: a survey
- Some convergence results on the regularized alternating least-squares method for tensor decomposition
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- Global Optimization with Polynomials and the Problem of Moments
- Solving Underdetermined Systems of Multivariate Quadratic Equations Revisited
- Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- Tensor Methods for Nonlinear Equations
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- LATIN 2004: Theoretical Informatics