Two new state-lifting moment-SOS hierarchies exploit composition and tensor train structure to compute certified bounds for large polynomial optimization problems.
Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Composition and tensor train structure in polynomial optimization
Two new state-lifting moment-SOS hierarchies exploit composition and tensor train structure to compute certified bounds for large polynomial optimization problems.