Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
From MaRDI portal
Publication:2422614
DOI10.1007/s40305-018-0194-6zbMath1438.65087OpenAlexW2791407135WikidataQ114219390 ScholiaQ114219390MaRDI QIDQ2422614
Publication date: 20 June 2019
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-018-0194-6
Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (2)
The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor ⋮ On decompositions and approximations of conjugate partial-symmetric tensors
Uses Software
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Orthogonal and unitary tensor decomposition from an algebraic perspective
- Orthogonal Tensor Decompositions
- Rank-One Approximation to High Order Tensors
- Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
- Tensor decompositions for learning latent variable models
- A Constructive Algorithm for Decomposing a Tensor into a Finite Sum of Orthonormal Rank-1 Terms
- On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
- Orthogonal Low Rank Tensor Approximation: Alternating Least Squares Method and Its Global Convergence
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Greedy Approaches to Symmetric Orthogonal Tensor Decomposition
- The geometric measure of multipartite entanglement and the singular values of a hypermatrix
- Strong duality in lasserre's hierarchy for polynomial optimization
This page was built for publication: Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
