On decompositions and approximations of conjugate partial-symmetric tensors
From MaRDI portal
Publication:2240646
DOI10.1007/S10092-021-00437-2zbMATH Open1476.15040arXiv1802.09013OpenAlexW3207837267WikidataQ114228532 ScholiaQ114228532MaRDI QIDQ2240646FDOQ2240646
Bo Jiang, Taoran Fu, Zhening Li
Publication date: 4 November 2021
Published in: Calcolo (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1802.09013
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
Hermitian matrixtensor eigenvaluetensor rankrank-one approximationrank-one decompositionconjugate partial-symmetric tensorpartial-symmetric tensortensor matricization
Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Nuclear norm of higher-order tensors
- Tensor principal component analysis via convex optimization
- Eigenvalues of a real supersymmetric tensor
- Most Tensor Problems Are NP-Hard
- Title not available (Why is that?)
- Title not available (Why is that?)
- The cubic spherical optimization problems
- Symmetric tensor decomposition
- Über homogene Polynome in ($L^{2}$)
- Symmetric Tensors and Symmetric Tensor Rank
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- The constitutive tensor of linear elasticity: Its decompositions, Cauchy relations, null Lagrangians, and wave propagation
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Complex Quadratic Optimization and Semidefinite Programming
- Tensor eigenvalues and their applications
- Unconstrained Optimization of Real Functions in Complex Variables
- Approximation algorithms for indefinite complex quadratic maximization problems
- Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
- Geometric measure of entanglement and U-eigenvalues of tensors
- Generating polynomials and symmetric tensor decompositions
- Moments Tensors, Hilbert's Identity, and k-wise Uncorrelated Random Variables
- Inhomogeneous polynomial optimization over a convex set: An approximation approach
- Strong duality in lasserre's hierarchy for polynomial optimization
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
- Convexification of Power Flow Equations in the Presence of Noisy Measurements
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Approximation methods for complex polynomial optimization
- Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems
- A Counterexample to Comon's Conjecture
- Some properties of tensor products of matrices
- Positive definiteness of paired symmetric tensors and elasticity tensors
- On Waring's problem for many forms and Grassmann defective varieties
- Hermitian Tensor Decompositions
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
- Hermitian tensor product approximation of complex matrices and separability
- Exact line and plane search for tensor optimization
Cited In (4)
Uses Software
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)
