2 citations · 4 across the 3 of their papers we have counts for
3 papers
math.OC2022★ 1 cited
Lift, Partition, and Project: Parametric Complexity Certification of Active-Set QP Methods in the Presence of Numerical Errors
Daniel Arnström, Daniel Axehill
When Model Predictive Control (MPC) is used in real-time to control linear systems, quadratic programs (QPs) need to be solved within a limited time frame. Recently, several parame…
math.OC2022★ 2 cited
BnB-DAQP: A Mixed-Integer QP Solver for Embedded Applications
Daniel Arnström, Daniel Axehill
We propose a mixed-integer quadratic programming (QP) solver that is suitable for use in embedded applications, for example, hybrid model predictive control (MPC). The solver is ba…
eess.SY2022★ 1 cited
Overall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming
Shamisa Shoja, Daniel Arnström, Daniel Axehill
This paper presents a method to certify the computational complexity of a standard Branch and Bound method for solving Mixed-Integer Quadratic Programming (MIQP) problems defined a…