Rank properties and computational methods for orthogonal tensor decompositions
From MaRDI portal
Publication:2680324
Abstract: The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and prove the lower semicontinuity of orthogonal rank. The lower semicontinuity guarantees the existence of low orthogonal rank approximation. To fit the orthogonal decomposition, we propose an algorithm based on the augmented Lagrangian method and guarantee the orthogonality by a novel orthogonalization procedure. Numerical experiments show that the proposed method has a great advantage over the existing methods for strongly orthogonal decompositions in terms of the approximation error.
Recommendations
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- Bounds on strongly orthogonal ranks of tensors
- Numerical computation for orthogonal low-rank approximation of tensors
- Orthogonal decomposition of tensor trains
- A constructive algorithm for decomposing a tensor into a finite sum of orthonormal rank-1 terms
Cites work
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- A Multilinear Singular Value Decomposition
- A nonlinear GMRES optimization algorithm for canonical tensor decomposition
- A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Blind Multilinear Identification
- Canonical polyadic decomposition with a columnwise orthonormal factor matrix
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Independent component analysis, a new concept?
- Line search algorithms with guaranteed sufficient decrease
- Most tensor problems are NP-hard
- Nonlinearly preconditioned L-BFGS as an acceleration mechanism for alternating least squares with application to tensor decomposition.
- Numerical computation for orthogonal low-rank approximation of tensors
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- On the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC model
- On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
- Orthogonal low rank tensor approximation: alternating least squares method and its global convergence
- Orthogonal tensor decompositions
- Spectral Unmixing via Data-Guided Sparsity
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor rank is NP-complete
- The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Variational Analysis
Cited in
(24)- Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization
- Orthogonal and unitary tensor decomposition from an algebraic perspective
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Bounds on strongly orthogonal ranks of tensors
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- Condition numbers for the tensor rank decomposition
- A constructive algorithm for decomposing a tensor into a finite sum of orthonormal rank-1 terms
- Rank formulae from the perspective of orthogonal projectors
- scientific article; zbMATH DE number 7387190 (Why is no real title available?)
- On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-(1,L_r,L_r) Terms
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Hankel Tensor Decompositions and Ranks
- Structured Rank-(r1, . . . , rd) Decomposition of Function-related Tensors in R_D
- On the average condition number of tensor rank decompositions
- Orthogonal decomposition of tensor trains
- Further results on tensor nuclear norms
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- The generalized tensor decomposition with heterogeneous tensor product for third-order tensors
- A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data
- A novel \(\ell_0\) minimization framework of tensor tubal rank and its multi-dimensional image completion application
- A novel nonconvex rank approximation with application to the matrix completion
- Frequency-aware tensor network decomposition for multi-dimensional image recovery
- Slice-wise irregular tensor decomposition and its application
- The complexity of tensor rank
This page was built for publication: Rank properties and computational methods for orthogonal tensor decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680324)
