Parallel KKT Solver in PIQP for Multistage Optimization
By: Fenglong Song , Roland Schwan , Yuwen Chen and more
Potential Business Impact:
Makes racing cars drive faster and smarter.
This paper presents an efficient parallel Cholesky factorization and triangular solve algorithm for the Karush-Kuhn-Tucker (KKT) systems arising in multistage optimization problems, with a focus on model predictive control and trajectory optimization for racing. The proposed approach directly parallelizes solving the KKT systems with block-tridiagonal-arrow KKT matrices on the linear algebra level arising in interior-point methods. The algorithm is implemented as a new backend of the PIQP solver and released as open source. Numerical experiments on the chain-of-masses benchmarks and a minimum curvature race line optimization problem demonstrate substantial performance gains compared to other state-of-the-art solvers.
Similar Papers
Exploiting Multistage Optimization Structure in Proximal Solvers
Optimization and Control
Solves hard math problems much faster.
Polynomial and Parallelizable Preconditioning for Block Tridiagonal Positive Definite Matrices
Optimization and Control
Speeds up robots solving hard math problems.
Harnessing Batched BLAS/LAPACK Kernels on GPUs for Parallel Solutions of Block Tridiagonal Systems
Mathematical Software
Speeds up computer calculations for complex problems.