A sum-of-linear-times-convex decomposition with an optimized choice of the convex pieces yields a semidefinite relaxation and branch-and-bound method for polynomial optimization that scales to larger instances than SOS.
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
REJECT 1representative citing papers
citing papers explorer
-
A novel exact approach to polynomial optimization
A sum-of-linear-times-convex decomposition with an optimized choice of the convex pieces yields a semidefinite relaxation and branch-and-bound method for polynomial optimization that scales to larger instances than SOS.