Relaxation of the rank-1 tensor approximation using different norms
From MaRDI portal
Recommendations
- Rank-1 tensor properties with applications to a class of tensor optimization problems
- Semidefinite relaxations for best rank-1 tensor approximations
- Properties and methods for finding the best rank-one approximation to higher-order tensors
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Best nonnegative rank-one approximations of tensors
Cites work
- A Low-Complexity Nonlinear Least Mean Squares Filter Based on a Decomposable Volterra Model
- A Multilinear Singular Value Decomposition
- A neural tensor decomposition model for high-order sparse data recovery
- Adaptive nonlinear system identification. The Volterra and Wiener model approaches.
- Algorithm 862
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Best nonnegative rank-one approximations of tensors
- Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
- Common and individual structure of brain networks
- Conjugate gradient-like methods for solving general tensor equation with Einstein product
- Constrained optimization with low-rank tensors and applications to parametric problems with PDEs
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
- Euclidean embedding of co-occurrence data
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- Low-rank tensor completion by Riemannian optimization
- Most tensor problems are NP-hard
- Nonlinear system modeling and identification using Volterra‐PARAFAC models
- On best rank one approximation of tensors
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors
- On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
- Parameter estimation for nonlinear Volterra systems by using the multi-innovation identification theory and tensor decomposition
- Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
- Semidefinite relaxations for best rank-1 tensor approximations
- SVD-based algorithms for the best rank-1 approximation of a symmetric tensor
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor factorisation for narrowband single channel source decomposition
- Tensor method for optimal control problems constrained by fractional three‐dimensional elliptic operator with variable coefficients
- Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations
- Uniqueness of Nonnegative Tensor Approximations
This page was built for publication: Relaxation of the rank-1 tensor approximation using different norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611979)
