Proves weak and strong duality between function-space and measure-space convex relaxations of constrained variational problems, establishing their equivalence for SDP hierarchy computations when data are polynomial.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Duality of convex relaxations for constrained variational problems
Proves weak and strong duality between function-space and measure-space convex relaxations of constrained variational problems, establishing their equivalence for SDP hierarchy computations when data are polynomial.