A note that flags an oversight in RLT convergence proofs for polynomial optimization and recovers correctness via one extra natural assumption.
Further results on an abstract model for branching and its application to mixed integer programming , url =
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 note on the convergence guarantees of RLT-based algorithms for polynomial optimization
A note that flags an oversight in RLT convergence proofs for polynomial optimization and recovers correctness via one extra natural assumption.