Hermitian Tensor Decompositions
From MaRDI portal
Publication:5146612
DOI10.1137/19M1306889zbMath1465.15030arXiv1912.07175OpenAlexW3047404910MaRDI QIDQ5146612
Publication date: 26 January 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.07175
Positive matrices and their generalizations; cones of matrices (15B48) Multilinear algebra, tensor calculus (15A69) Quantum state spaces, operational and probabilistic concepts (81P16)
Related Items (11)
Separability of Hermitian tensors and PSD decompositions ⋮ Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations ⋮ Partially symmetric tensor structure preserving rank-\(R\) approximation via BFGS algorithm ⋮ The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor ⋮ Further results on tensor nuclear norms ⋮ Symmetric Hermitian decomposability criterion, decomposition, and its applications ⋮ Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms ⋮ On decompositions and approximations of conjugate partial-symmetric tensors ⋮ Resonant Hamiltonian systems and weakly nonlinear dynamics in AdS spacetimes ⋮ A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Eigenvectors of tensors and algorithms for Waring decomposition
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Density matrix theory and applications.
- Symmetric tensor decomposition
- Linear optimization with cones of moments and nonnegative polynomials
- A tensor product matrix approximation problem in quantum physics
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- General tensor decomposition, moment matrices and applications
- On real typical ranks
- Identifiability of homogeneous polynomials and Cremona transformations
- Topology of tensor ranks
- How entangled can a multi-party system possibly be?
- Typical real ranks of binary forms
- Generating polynomials and symmetric tensor decompositions
- On maximum, typical and generic ranks
- Lectures on Modern Convex Optimization
- Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
- Positive Maps and Separable Matrices
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- Geometric Measure of Entanglement and U-Eigenvalues of Tensors
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL
- Quillen property of real algebraic varieties
- Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Symmetric Tensors and Symmetric Tensor Rank
- Effective Criteria for Specific Identifiability of Tensors and Forms
- Tensor Analysis
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
- Hankel Tensor Decompositions and Ranks
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Hermitian Tensor Decompositions
