Relaxation of the rank-1 tensor approximation using different norms
From MaRDI portal
Publication:6611979
DOI10.1553/etna_vol62s58zbMATH Open1548.651MaRDI QIDQ6611979
Publication date: 27 September 2024
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of matrix norms, conditioning, scaling (65F35) Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors
- Low-rank tensor completion by Riemannian optimization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
- Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations
- Parameter estimation for nonlinear Volterra systems by using the multi-innovation identification theory and tensor decomposition
- Conjugate gradient-like methods for solving general tensor equation with Einstein product
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- Tensor factorisation for narrowband single channel source decomposition
- Common and individual structure of brain networks
- Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
- Adaptive nonlinear system identification. The Volterra and Wiener model approaches.
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- Bounds on the Spectral Norm and the Nuclear Norm of a Tensor Based on Tensor Partitions
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- On best rank one approximation of tensors
- Constrained Optimization with Low-Rank Tensors and Applications to Parametric Problems with PDEs
- Uniqueness of Nonnegative Tensor Approximations
- SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor
- Algorithm 862
- On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Tensor Decomposition for Signal Processing and Machine Learning
- Nonlinear system modeling and identification using Volterra‐PARAFAC models
- Tensor method for optimal control problems constrained by fractional three‐dimensional elliptic operator with variable coefficients
- Best Nonnegative Rank-One Approximations of Tensors
- A Low-Complexity Nonlinear Least Mean Squares Filter Based on a Decomposable Volterra Model
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- Most Tensor Problems Are NP-Hard
- A neural tensor decomposition model for high-order sparse data recovery
This page was built for publication: Relaxation of the rank-1 tensor approximation using different norms