mlsanityData to 7 Oct 2026

MPAX: Mathematical Programming in JAX

arXiv 2412.09734 ↗First posted 12 Dec 2024math.OC cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

We present MPAX (Mathematical Programming in JAX), an open-source first-order solver for large-scale linear programming (LP) and convex quadratic programming (QP) built natively in JAX. The primary goal of MPAX is to exploit modern machine learning infrastructure for large-scale mathematical programming, while also providing advanced mathematical programming algorithms that are easy to integrate into machine learning workflows. MPAX implements two PDHG variants, r2HPDHG for LP and rAPDHG for QP, together with diagonal preconditioning, adaptive restarts, adaptive step sizes, primal-weight updates, infeasibility detection, and feasibility polishing. Leveraging JAX's compilation and parallelization ecosystem, MPAX provides across-hardware portability, batched solving, distributed optimization, and automatic differentiation. We evaluate MPAX on CPUs, NVIDIA GPUs, and Google TPUs, observing substantial GPU speedups over CPU baselines and competitive performance relative to GPU-based codebases on standard LP/QP benchmarks. Our numerical experiments further demonstrate MPAX's capabilities in high-throughput batched solving, near-linear multi-GPU scaling for dense LPs, and efficient end-to-end differentiable training. The solver is publicly available at https://github.com/MIT-Lu-Lab/MPAX.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 24 of its 40 references that are in the map. First posted on arXiv 12 Dec 2024.

Builds on

24 of 40 references.

References · 24

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2015Automatic differentiation in machine learning: a surveycited by 846
  4. 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
  5. 2019Differentiable Convex Optimization Layerscited by 458
  6. 2017Smart "Predict, then Optimize"cited by 332
  7. 2019Differentiation of Blackbox Combinatorial Solverscited by 224
  8. 2021Efficient and Modular Implicit Differentiationcited by 199
  9. 2018Differentiable MPC for End-to-end Planning and Controlcited by 178
  10. 2017OSQP: An Operator Splitting Solver for Quadratic Programscited by 156
  11. 2021Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradientcited by 31
  12. 2022Cardinal Optimizer (COPT) User Guidecited by 16
12 more
  1. 2019GPU Acceleration of ADMM for Large-Scale Quadratic Programmingcited by 15
  2. 2019Optimization under Uncertainty in the Era of Big Data and Deep Learning: When Machine Learning Meets Mathematical Programmingcited by 13
  3. 2021Faster First-Order Primal-Dual Methods for Linear Programming using Restarts and Sharpnesscited by 13
  4. 2021A Theoretical and Computational Analysis of Full Strong-Branchingcited by 13
  5. 2023cuPDLP.jl: A GPU Implementation of Restarted Primal-Dual Hybrid Gradient for Linear Programming in Juliacited by 8
  6. 2023A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programmingcited by 7
  7. 2023cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C languagecited by 7
  8. 2024On the Differentiability of the Primal-Dual Interior-Point Methodcited by 5
  9. 2024Restarted Halpern PDHG for Linear Programmingcited by 5
  10. 2024Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programmingcited by 3
  11. 2024HPR-LP: An implementation of an HPR method for solving linear programmingcited by 3
  12. 2021Infeasibility detection with primal-dual hybrid gradient for large-scale linear programmingcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 4.

6 papers.