Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators

arXiv:2608.01385 · math.OC, stat.ML · Submitted 2026-08-02 · Read on arXiv

Tong Xu, Salar Fattahi, Andrés Gómez, Simge Küçükyavuz

math.OC, stat.ML

Submitted: 2026-08-02

Code: https://github.com/AtomXT/QP_indicator

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Core — 235× in this paper · explained in 2 episodes
• Sparsity — 77× in this paper · explained in 5 episodes
• Optimality Condition — 21× in this paper
• Regularization — 6× in this paper · explained in 3 episodes
• Pruning — 5× in this paper · explained in 4 episodes
• Benchmark — 3× in this paper · explained in 2 episodes
• Combinatorial Optimization — 3× in this paper · explained in 2 episodes
• Accelerometer Data — 2× in this paper · explained in 1 episode
• Fidelity — 2× in this paper · explained in 2 episodes
• Composition — 1× in this paper · explained in 2 episodes
• Consistency — 1× in this paper · explained in 3 episodes
• F1 Score — 1× in this paper · explained in 4 episodes
• Generalization — 1× in this paper · explained in 14 episodes
• Loss Function — 1× in this paper · explained in 2 episodes
• Papers — 1× in this paper · explained in 3 episodes
• Personalization — 1× in this paper · explained in 2 episodes
• Structural Properties — 1× in this paper · explained in 2 episodes
• Topological Order — 1× in this paper · explained in 4 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Solving Convex Quadratic Optimization with Indicators Over Structured Graphs
• Solving convex QPs with structured sparsity under indicator conditions
• Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection
• Solution Path of Time-varying Markov Random Fields with Discrete Regularization
• Real-time solution of quadratic optimization problems with banded matrices and indicator variables
• Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements
• Efficient inference of dynamic gene regulatory networks using discrete penalty

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Beyond Aggregate Drift: Optimal Client-Specific Windows in Federated Learning
• Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets
• Second-Order Optimization with Asynchronous Curvature