math.OCMay 2, 2025

Differentiable Nonlinear Model Predictive Control

Authors: Jonathan Frey, Katrin Baumgärtner, Gianluca Frison, Dirk Reinhardt, Jasper Hoffmann, Leonard Fichtner, Sebastien Gros, Moritz Diehl

Organizations: University Freiburg · NTNU Trondheim

Abstract

The efficient computation of parametric solution sensitivities is a key challenge in the integration of learning-enhanced methods with nonlinear model predictive control, as their availability is crucial for many learning algorithms. This paper discusses the computation of solution sensitivities of general nonlinear programs using the implicit function theorem and smoothed optimality conditions treated in interior-point methods (IPM). We introduce sequential barrier quadratic programming (SBQP), which generalizes SQP with an IPM quadratic programming (QP) solver by allowing the barrier parameter to approach a prescribed nonnegative target value, recovering classical SQP when this target is zero. Previous works are limited to convex or unconstrained formulations, or lack an implementation for efficient sensitivity evaluation. The publication is accompanied by an efficient open-source implementation within the acados framework, providing both forward and adjoint sensitivities for general optimal control problems, achieving speedups exceeding 3x over the state-of-the-art solvers mpc.pytorch and cvxpygen.

Figures & tables

Appendix figures & tables5 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Amortized Nonlinear Model Predictive Control

    Jun 4, 2026Francesco Pillitteri, Alberto BemporadRobotic ControlNonlinear MPC

  2. Safe Approximate Nonlinear Model Predictive Control Without Expert Demonstrations

    Mar 25, 2026Mihaela-Larisa Clement, Mónika Farsang, Johannes Edelmann +5Nonlinear MPCModel Predictive Control

  3. lapanda: A Matrix-Free Differentiable Solver for Nonconvex Constrained Optimization Layers

    Sep 27, 2026Yuankun Chen, Zifei Nie, Kangyu Lin +2Differentiable ProgrammingNonconvex Optimization