We present FAME-QP, a GPU-accelerated solver for dense quadratic programs arising in linear model predictive control. FAME-QP combines constraint-dependent operator representations with fused single- and two-kernel iterations replayed through CUDA graphs, automatically selecting the execution configuration through device calibration and problem-specific timing. It probes a cached operator bank to select the initial penalty and updates operators lazily when problem matrices change. Numerical benchmarks and simulated humanoid and quadrotor control experiments demonstrate reduced latency relative to competing GPU solvers while maintaining solution accuracy and control performance.
Figures & tables
Fig. 1: Cold-solve times on dense random QPs at matched accuracy, excluding setup. Lines show medians and bands min–max ranges across five instances, each timed by its median over repeated cold solves. All solvers use float64 except cuOSQP ( float32 ).
Solver / n
400
800
1200
1600
2000
FAME-QP
0.658±0.066
1.19±0.04
2.05±0.45
2.92±0.09
4.23±0.21
ReLU-QP
2.10±0.37
6.06±1.02
11.6±1.9
20.0±3.9
30.9±6.1
CuPIQP
23.7±7.0
58.9±11.3
178±42
248±63
449±120
CUDA MPC
22.7±0.1
59.9±0.5
82.8±0.8
103±0
138±3
π MPC
9.06±12.39
8.90±12.88
6.78±5.67
15.4±23.9
13.4±18.1
TABLE I: Online MPC step times [ms], mean ± standard deviation over 50 steps. Setup and initialization are excluded; fastest means are bold.
N ( n )
QP time [ms]
CoM RMS [mm]
FAME-QP
ReLU-QP
FAME-QP
ReLU-QP
10 (290)
0.650±0.091
1.47±0.05
18.7
18.7
15 (435)
0.763±0.116
2.26±0.12
19.1
19.2
20 (580)
1.04±0.20
3.25±0.13
20.5
19.5
TABLE II: Unitree G1 push recovery. QP times are mean ± std, excluding the first step.
Fig. 2: Unitree G1 push recovery in MuJoCo with FAME-QP : torso push, maximum lean, return, and final stance.
Fig. 3: Skydio X2 trajectory tracking in MuJoCo with FAME-QP .
Execution time per iteration [ μ s]
n
Unfused
Unfused
Fused
Fused
eager
graph
eager
graph
128
140
24.6
21.1
4.37
512
146
33.4
21.8
17.4
1028
145
72.9
54.4
53.4
Starting-penalty probing, common bank, ϵ=10−5
TABLE III: Execution and penalty ablations. Execution: median device time per iteration over 100 repetitions. Probing: mean iteration counts and mean per-instance median wall times over five test instances, with 20 cold solves per instance. Setup is excluded.
Quadratic programming optimizes quadratic objectives under constraints, supporting applications from robotics and control to finance and machine learning.
Institute for Data Science in Mechanical Engineering (DSME), RWTH Aachen University, Germany · Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge MA, USA.
Automatic Control Laboratory, EPFL, Switzerland. · Accessible and Accelerated Robotics Lab, Dartmouth College, USA. · Institute for Transport Planning and Systems, ETH Zürich, Switzerland.