The paper reformulates completely positive tensor decomposition using maximal cliques of multi-hypergraphs, yielding an ideal-sparse moment hierarchy that is much faster than dense relaxations and provably equivalent.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
The paper reformulates completely positive tensor decomposition using maximal cliques of multi-hypergraphs, yielding an ideal-sparse moment hierarchy that is much faster than dense relaxations and provably equivalent.