A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
DOI10.1287/MOOR.2021.1231zbMATH Open1505.15025OpenAlexW4210993896MaRDI QIDQ5870360FDOQ5870360
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
Recommendations
- A semidefinite algorithm for completely positive tensor decomposition
- A semidefinite method for tensor complementarity problems
- Symmetric tensor decomposition by an iterative eigendecomposition algorithm
- Semidefinite relaxation algorithm for solving tensor split feasibility problem
- On decompositions and approximations of conjugate partial-symmetric tensors
- Semidefinite relaxations for best rank-1 tensor approximations
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Symmetric tensor decomposition by alternating gradient descent
- An SDP method for copositivity of partially symmetric tensors
- Approximating symmetric positive semidefinite tensors of even order
polynomial optimizationsemidefinite relaxationtruncated moment problempartially symmetric tensortensor CP-decomposition
Multilinear algebra, tensor calculus (15A69) Semidefinite programming (90C22) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Semialgebraic sets and related spaces (14P10)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- General tensor decomposition, moment matrices and applications
- Tensor Decompositions and Applications
- Global optimization with polynomials and the problem of moments
- Most tensor problems are NP-hard
- Ranks and symmetric ranks of cubic surfaces
- GloptiPoly 3: moments, optimization and semidefinite programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Symmetric tensor decomposition
- An exact Jacobian SDP relaxation for polynomial optimization
- On the ranks and border ranks of symmetric tensors
- The truncated moment problem via homogenization and flat extensions
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Symmetric Tensors and Symmetric Tensor Rank
- Truncated \(K\)-moment problems in several variables
- Topology of tensor ranks
- The hierarchy of local minimums in polynomial optimization
- Comon's conjecture, rank decomposition, and symmetric rank decomposition of symmetric tensors
- Best rank-one approximation of fourth-order partially symmetric tensors by neural network
- A semidefinite method for tensor complementarity problems
- On the partially symmetric rank of tensor products of \(W\)-states and other symmetric tensors
- A Riemannian trust region method for the canonical tensor rank approximation problem
- Hermitian tensor decompositions
- Partially symmetric variants of Comon's problem via simultaneous rank
- Separability of Hermitian tensors and PSD decompositions
- Symmetric Hermitian decomposability criterion, decomposition, and its applications
- Completely positive binary tensors
Cited In (8)
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization
- On decompositions and approximations of conjugate partial-symmetric tensors
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
- Partially symmetric tensor structure preserving rank-\(R\) approximation via BFGS algorithm
- Line search and trust region strategies for canonical decomposition of semi-nonnegative semi-symmetric 3rd order tensors
- Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors
Uses Software
This page was built for publication: A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870360)
