A semidefinite algorithm for completely positive tensor decomposition
From MaRDI portal
Publication:513715
DOI10.1007/s10589-016-9870-9zbMath1366.65053OpenAlexW2520371404MaRDI QIDQ513715
Publication date: 7 March 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9870-9
numerical examplestruncated moment problemsemidefinite programcompletely positive tensornonnegative decomposition
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Completely positive tensor recovery with minimal nuclear value ⋮ Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications ⋮ Dehomogenization for completely positive tensors ⋮ Completely Positive Binary Tensors ⋮ Completely positive tensors in the complex field ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Symmetric nonnegative tensors and copositive tensors
- The truncated moment problem via homogenization and flat extensions
- On the computational complexity of membership problems for the completely positive cone and its dual
- Strictly nonnegative tensors and nonnegative tensor partition
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Linear optimization with cones of moments and nonnegative polynomials
- Interiors of completely positive cones
- A semidefinite programming approach to the generalized problem of moments
- Completely positive matrices.
- Numerical optimization for symmetric tensor decomposition
- Completely positive reformulations for polynomial optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Generating polynomials and symmetric tensor decompositions
- Global Optimization with Polynomials and the Problem of Moments
- The CP-Matrix Completion Problem
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- Shifted Power Method for Computing Tensor Eigenpairs
- GloptiPoly 3: moments, optimization and semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
- All Real Eigenvalues of Symmetric Tensors
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Symmetric Tensors and Symmetric Tensor Rank
This page was built for publication: A semidefinite algorithm for completely positive tensor decomposition