A certificate of unboundedness is introduced for arbitrary polynomial optimization problems to detect cases with no finite lower bound.
arXiv preprint (2024) arXiv:2405.19309 [cs.RO]
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
-
A Certificate of Unboundedness for Polynomial Optimization Problems
A certificate of unboundedness is introduced for arbitrary polynomial optimization problems to detect cases with no finite lower bound.