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, alongside 11 external citations. Polarity classification is still indexing.
1
Pith paper citing it
11
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 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.