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.
Solving convex quadratic optimization with indicators over structured graphs.arXiv preprint arXiv:2603.02103, 2026
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 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.