PROX-QP: Yet another Quadratic Programming Solver for Robotics and beyond - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

PROX-QP: Yet another Quadratic Programming Solver for Robotics and beyond


Quadratic programming (QP) has become a core modelling component in the modern engineering toolkit. This is particularly true for simulation, planning and control in robotics. Yet, modern numerical solvers have not reached the level of efficiency and reliability required in practical applications where speed, robustness, and accuracy are all necessary. In this work, we introduce a few variations of the well-established augmented Lagrangian method, specifically for solving QPs, which include heuristics for improving practical numerical performances. Those variants are embedded within an open-source software which includes an efficient C++ implementation, a modular API, as well as best-performing heuristics for our test-bed. Relying on this framework, we present a benchmark studying the practical performances of modern optimization solvers for convex QPs on generic and complex problems of the literature as well as on common robotic scenarios. This benchmark notably highlights that this approach outperforms modern solvers in terms of efficiency, accuracy and robustness for small to medium-sized problems, while remaining competitive for higher dimensions.
Fichier principal
Vignette du fichier
Yet_another_QP_solver_for_robotics_and_beyond.pdf (418.43 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03683733 , version 1 (31-05-2022)


  • HAL Id : hal-03683733 , version 1


Antoine Bambade, Sarah El-Kazdadi, Adrien Taylor, Justin Carpentier. PROX-QP: Yet another Quadratic Programming Solver for Robotics and beyond. RSS 2022 - Robotics: Science and Systems, Jun 2022, New York, United States. ⟨hal-03683733⟩
486 View
1880 Download


Gmail Mastodon Facebook X LinkedIn More