In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is typically the main computational effort at each iteration. In this paper, we compare a number of solvers for an extended formulation of the LQ control problem: a Riccati recursion based solver can be considered the best choice for the general problem with dense matrices. Furthermore, we present a novel version of the Riccati solver, that makes use of the Cholesky factorization of the Pn matrices to reduce the number of flops. When combined with regularization and mixed precision, this algorithm can solve large instances of the LQ control problem up to 3 times faster than the classical Riccati solver.
|Title of host publication||2013 IEEE Multi-conference on Systems and Control|
|Publication status||Published - 2013|
|Event||IEEE Multi-Conference on Systems and Control (MSC 2013) - Hyderabad, India|
Duration: 28 Aug 2013 → 30 Aug 2013
|Conference||IEEE Multi-Conference on Systems and Control (MSC 2013)|
|Period||28/08/2013 → 30/08/2013|