A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
From MaRDI portal
Recommendations
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Symmetric tensor approximation hierarchies for the completely positive cone
- Dehomogenization for completely positive tensors
- Completely positive reformulations for polynomial optimization
- A semidefinite algorithm for completely positive tensor decomposition
Cites work
- scientific article; zbMATH DE number 1820149 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- A semidefinite algorithm for completely positive tensor decomposition
- All real eigenvalues of symmetric tensors
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Completely positive reformulations for polynomial optimization
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Generating polynomials and symmetric tensor decompositions
- GloptiPoly 3: moments, optimization and semidefinite programming
- Linear optimization with cones of moments and nonnegative polynomials
- Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
- Numerical optimization for symmetric tensor decomposition
- On the complexity of Putinar's Positivstellensatz
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Semidefinite relaxations for best rank-1 tensor approximations
- Shifted power method for computing tensor eigenpairs
- Strictly nonnegative tensors and nonnegative tensor partition
- Sums of squares, moment matrices and optimization over polynomials
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetric nonnegative tensors and copositive tensors
- Tensor Decompositions and Applications
- The CP-matrix approximation problem
- The CP-matrix completion problem
- The \(\mathcal A\)-truncated \(K\)-moment problem
- The truncated moment problem via homogenization and flat extensions
- Truncated \(K\)-moment problems in several variables
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs
Cited in
(13)- Symmetric tensor approximation hierarchies for the completely positive cone
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Lower bounds for maximal cp-ranks of completely positive matrices and tensors
- Dehomogenization for completely positive tensors
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
- Completely positive tensor recovery with minimal nuclear value
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
- Copositive tensor optimization problem and its applications to hypergraphs
- The CP-matrix approximation problem
- Some advances in tensor analysis and polynomial optimization
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
This page was built for publication: A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274887)
