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 QPs with structured sparsity under indicator conditions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study convex optimization problems where disjoint blocks of variables are controlled by binary indicator variables that are also subject to conditions, e.g., cardinality. Several classes of important examples can be formulated in such a way that both the objective and the constraints are separable convex quadratics. We describe a family of polynomial-time approximation algorithms and negative complexity results.
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.