3 papers
eess.SY2026
APX-Hardness of Computing Lipschitz Constants for Multi-Parametric Quadratic Programs
Xingchen Li, Kunpeng Liu, Keyou You
Computing the Lipschitz constant of the solution map of a multi-parametric quadratic program is important for the analysis of optimization-based control. This problem is governed b…
cs.AI2026
LLM4Branch: Large Language Model for Discovering Efficient Branching Policies of Integer Programs
Zhinan Hou, Xingchen Li, Yankai Zhang +2
Efficient branching policies are essential for accelerating Mixed Integer Linear Programming (MILP) solvers. Their design has long relied on hand-crafted heuristics, and now machin…
eess.SY2026
ReLU Networks for Model Predictive Control: Network Complexity and Performance Guarantees
Xingchen Li, Keyou You
Recent years have witnessed a resurgence in using ReLU neural networks (NNs) to represent model predictive control (MPC) policies. However, determining the required network complex…