The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor
From MaRDI portal
Publication:6151002
Abstract: We present an orthogonal matrix outer product decomposition for the fourth-order conjugate partial-symmetric (CPS) tensor and show that the greedy successive rank-one approximation (SROA) algorithm can recover this decomposition exactly. Based on this matrix decomposition, the CP rank of CPS tensor can be bounded by the matrix rank, which can be applied to low rank tensor completion. Additionally, we give the rank-one equivalence property for the CPS tensor based on the SVD of matrix, which can be applied on the rank-one approximation for CPS tensors.
Recommendations
- The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors
- On decompositions and approximations of conjugate partial-symmetric tensors
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
- An approximation method of CP rank for third-order tensor completion
- Best rank-one approximation of fourth-order partially symmetric tensors by neural network
Cites work
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- A Singular Value Thresholding Algorithm for Matrix Completion
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
- A sparse rank-1 approximation algorithm for high-order tensors
- Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
- Convexification of Power Flow Equations in the Presence of Noisy Measurements
- Fixed point and Bregman iterative methods for matrix rank minimization
- Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Hermitian tensor decompositions
- Low-rank approximation of tensors via sparse optimization.
- Maximum block improvement and polynomial optimization
- Most tensor problems are NP-hard
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Rank-1 tensor properties with applications to a class of tensor optimization problems
- Rank-one approximation to high order tensors
- Shifted power method for computing tensor eigenpairs
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor principal component analysis via convex optimization
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
- The quadratic eigenvalue problem
This page was built for publication: The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151002)
