A reformulation that injects coordinate-optimality conditions into indicator MIPs sharply cuts branch-and-bound work and yields polynomial tree bounds in several structured cases.
Sparse high-dimensional regression.The Annals of Statistics, 48(1):300–323, 2020
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators
A reformulation that injects coordinate-optimality conditions into indicator MIPs sharply cuts branch-and-bound work and yields polynomial tree bounds in several structured cases.