An Efficient Implementation of Partial Condensing for Nonlinear Model Predictive Control

Partial (or block) condensing is a recently proposed technique to reformulate a Model Predictive Control (MPC) problem into a form more suitable for structure-exploiting Quadratic Programming (QP) solvers. It trades off horizon length for input vector size, and this degree of freedom can be employed to find the best problem size for the QP solver at hand.

This paper proposes a Hessian condensing algorithm particularly well suited for partial condensing, where a state component is retained as an optimization variable at each stage of the partially condensed MPC problem. The optimal input-horizon trade-off is investigated from a theoretical point of view (based on algorithms flop count) as well as by benchmarking (in practice, the performance of linear algebra routines for different matrix sizes plays a key role).

Partial condensing can also be seen as a technique to replace many operations on small matrices with fewer operations on larger matrices, where linear algebra routines perform better. Therefore, in case of small-scale MPC problems, partial condensing can greatly improve performance beyond the flop count reduction.