On decompositions and approximations of conjugate partial-symmetric tensors
From MaRDI portal
(Redirected from Publication:2240646)
Abstract: Conjugate partial-symmetric (CPS) tensors are the high-order generalization of Hermitian matrices. As the role played by Hermitian matrices in matrix theory and quadratic optimization, CPS tensors have shown growing interest recently in tensor theory and optimization, particularly in many application-driven complex polynomial optimization problems. In this paper, we study CPS tensors with a focus on ranks, rank-one decompositions and approximations, as well as their applications. The analysis is conducted along side with a more general class of complex tensors called partial-symmetric tensors. We prove constructively that any CPS tensor can be decomposed into a sum of rank-one CPS tensors, which provides an alternative definition of CPS tensors via linear combinations of rank-one CPS tensors. Three types of ranks for CPS tensors are defined and shown to be different in general. This leads to the invalidity of the conjugate version of Comon's conjecture. We then study rank-one approximations and matricizations of CPS tensors. By carefully unfolding CPS tensors to Hermitian matrices, rank-one equivalence can be preserved. This enables us to develop new convex optimization models and algorithms to compute best rank-one approximation of CPS tensors. Numerical experiments from various data are performed to justify the capability of our methods.
Recommendations
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
- Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
- Hermitian tensor decompositions
- Symmetric rank-1 approximation of symmetric high-order tensors
Cites work
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- A counterexample to Comon's conjecture
- Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Approximation algorithms for indefinite complex quadratic maximization problems
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Approximation methods for complex polynomial optimization
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
- Complex Quadratic Optimization and Semidefinite Programming
- Convexification of Power Flow Equations in the Presence of Noisy Measurements
- Eigenvalues of a real supersymmetric tensor
- Exact line and plane search for tensor optimization
- Generating polynomials and symmetric tensor decompositions
- Geometric measure of entanglement and U-eigenvalues of tensors
- Hermitian tensor decompositions
- Hermitian tensor product approximation of complex matrices and separability
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
- Moments tensors, Hilbert's identity, and \(k\)-wise uncorrelated random variables
- Most tensor problems are NP-hard
- Nuclear norm of higher-order tensors
- On Waring's problem for many forms and Grassmann defective varieties
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Positive definiteness of paired symmetric tensors and elasticity tensors
- Rank-1 tensor properties with applications to a class of tensor optimization problems
- Semidefinite relaxations for best rank-1 tensor approximations
- Some properties of tensor products of matrices
- Strong duality in lasserre's hierarchy for polynomial optimization
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetric tensor decomposition
- Tensor eigenvalues and their applications
- Tensor principal component analysis via convex optimization
- The constitutive tensor of linear elasticity: Its decompositions, Cauchy relations, null Lagrangians, and wave propagation
- The cubic spherical optimization problems
- Unconstrained Optimization of Real Functions in Complex Variables
- Über homogene Polynome in ($L^{2}$)
Cited in
(10)- New results on Hermitian matrix rank-one decomposition
- The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor
- Lower bounds for the norms of decomposable symmetrized tensors
- Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization
- Hermitian tensor decompositions
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
- Comon's conjecture, rank decomposition, and symmetric rank decomposition of symmetric tensors
- scientific article; zbMATH DE number 6672348 (Why is no real title available?)
- An alternating shifted higher order power method based algorithm for rank-\(R\) Hermitian approximation and solving Hermitian CP-decomposition problems
This page was built for publication: On decompositions and approximations of conjugate partial-symmetric tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2240646)
