A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition

DOI10.1287/moor.2021.1231zbMath1505.15025OpenAlexW4210993896MaRDI QIDQ5870360

Ying Li, Guyan Ni

Publication date: 9 January 2023

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2021.1231

zbMATH Keywords

polynomial optimizationsemidefinite relaxationtruncated moment problempartially symmetric tensortensor CP-decomposition

Mathematics Subject Classification ID

Semidefinite programming (90C22) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Semialgebraic sets and related spaces (14P10) Multilinear algebra, tensor calculus (15A69)

Related Items (2)

Partially symmetric tensor structure preserving rank-\(R\) approximation via BFGS algorithm ⋮ Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors

Uses Software

• SeDuMi
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• The truncated moment problem via homogenization and flat extensions
• The \(\mathcal A\)-truncated \(K\)-moment problem
• Symmetric tensor decomposition
• On the ranks and border ranks of symmetric tensors
• General tensor decomposition, moment matrices and applications
• An exact Jacobian SDP relaxation for polynomial optimization
• Topology of tensor ranks
• Ranks and symmetric ranks of cubic surfaces
• The hierarchy of local minimums in polynomial optimization
• On the partially symmetric rank of tensor products of \(W\)-states and other symmetric tensors
• Symmetric Hermitian decomposability criterion, decomposition, and its applications
• Global Optimization with Polynomials and the Problem of Moments
• Comon's Conjecture, Rank Decomposition, and Symmetric Rank Decomposition of Symmetric Tensors
• GloptiPoly 3: moments, optimization and semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
• Completely Positive Binary Tensors
• Hermitian Tensor Decompositions
• Best Rank-One Approximation of Fourth-Order Partially Symmetric Tensors by Neural Network
• Partially Symmetric Variants of Comon's Problem Via Simultaneous Rank
• A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
• Symmetric Tensors and Symmetric Tensor Rank
• A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
• A semidefinite method for tensor complementarity problems
• Most Tensor Problems Are NP-Hard
• Separability of Hermitian tensors and PSD decompositions

This page was built for publication: A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition