The authors prove that arrow decomposition can be applied after forming moment-SOS relaxations of polynomial matrix inequalities, yielding convergent lower bounds and significant computational speedups in structural optimization.
Mathematical programming 146, 97–121 (2014)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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
-
Moment-SOS hierarchies for arrow-type polynomial matrix inequalities with applications to structural optimization
The authors prove that arrow decomposition can be applied after forming moment-SOS relaxations of polynomial matrix inequalities, yielding convergent lower bounds and significant computational speedups in structural optimization.