DAQP is a dual active-set solver that solves convex quadratic programs in the form
minimize 0.5 x' H x + f' x
subject to l <= x <= u
bl <= Ax <= bu.
The code is written in C and is library free. DAQP can be interfaced to C, Julia, MATLAB, and Python.
See Documentation for an installation guide and basic use of the interfaces.
@article{arnstrom2022dual,
author={Arnström, Daniel and Bemporad, Alberto and Axehill, Daniel},
journal={IEEE Transactions on Automatic Control},
title={A Dual Active-Set Solver for Embedded Quadratic Programming Using Recursive {LDL}$^{T}$ Updates},
year={2022},
volume={67},
number={8},
pages={4362-4369},
doi={10.1109/TAC.2022.3176430}
}