activity
20222026
most citedOverall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming

1 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

eess.SY2026

DR-DAQP: A Hybrid Operator Splitting and Active-Set Solver for Affine Variational Inequalities

Daniel Arnström, Emilio Benenati, Giuseppe Belgioioso

We present DR-DAQP, an open-source solver for strongly monotone affine variational inequalities (AVIs) that combines Douglas-Rachford operator splitting with an active-set accelera…

eess.SY2026

Peak Bounds for the Estimation Error under Sensor Attacks

Axel Stafström, Daniel Arnström, Adam Miksits +1

This paper investigates bounds on the estimation error of a linear system affected by norm-bounded disturbances and full sensor attacks. The system is equipped with a detector that…

cs.LG2025★ 1 cited

Warm-starting active-set solvers using graph neural networks

Ella J. Schmidtobreick, Daniel Arnström, Paul Häusner +1

Quadratic programming (QP) solvers are widely used in real-time control and optimization, but their computational cost often limits applicability in time-critical settings. To reso…

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…

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…