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
Showing 2022Show all

2 papers · 1 filter

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…