A Hybrid Learning-to-Optimize Framework for Mixed-Integer Quadratic Programming
Viet-Anh Le, Mu Xie, Rahul Mangharam
TL;DR
This work addresses real-time solution of parametric mixed-integer quadratic programs (MIQPs) common in mixed-integer model predictive control (MI-MPC). It proposes a hybrid learning-to-optimize (L2O) framework that combines a neural network predicting integer decisions with a differentiable QP layer to obtain continuous decision variables, enabling backpropagation through the optimization problem. A hybrid loss blends supervised optimality with self-supervised feasibility, supported by a slack-variable QP relaxation to ensure differentiability even for infeasible intermediate problems, with theoretical guarantees on exactness when feasible and minimal violation when not. Empirical evaluation on two MI-MPC benchmarks shows substantial runtime gains (approximately 9x–12x faster than GUROBI) while balancing constraint satisfaction and near-global optimality, indicating strong potential for real-time control applications and for extending to broader problem classes in the future.
Abstract
In this paper, we propose a learning-to-optimize (L2O) framework to accelerate solving parametric mixed-integer quadratic programming (MIQP) problems, with a particular focus on mixed-integer model predictive control (MI-MPC) applications. The framework learns to predict integer solutions with enhanced optimality and feasibility by integrating supervised learning (for optimality), self-supervised learning (for feasibility), and a differentiable quadratic programming (QP) layer, resulting in a hybrid L2O framework. Specifically, a neural network (NN) is used to learn the mapping from problem parameters to optimal integer solutions, while a differentiable QP layer is integrated to compute the corresponding continuous variables given the predicted integers and problem parameters. Moreover, a hybrid loss function is proposed, which combines a supervised loss with respect to the global optimal solution, and a self-supervised loss derived from the problem's objective and constraints. The effectiveness of the proposed framework is demonstrated on two benchmark MI-MPC problems, with comparative results against purely supervised and self-supervised learning models.
