A certificate of unboundedness is introduced for arbitrary polynomial optimization problems to detect cases with no finite lower bound.
In: Emerging Applications of Algebraic Geometry, pp
2 Pith papers cite this work, alongside 152 external citations. Polarity classification is still indexing.
2
Pith papers citing it
152
external citations · OpenAlex
years
2026 2representative 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.
- Symmetric tensor decomposition on rational varieties