Outer approximation for convex MINLPs can cycle due to CQ failures or approximate solves, but extended cutting planes ensure finite convergence under weaker constraint qualification assumptions.
Title resolution pending
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
-
Separation, Constraint Qualifications, and Cycling in Outer Approximation
Outer approximation for convex MINLPs can cycle due to CQ failures or approximate solves, but extended cutting planes ensure finite convergence under weaker constraint qualification assumptions.