# Daniel Arnström: Publications

The following list of publications has been generated automatically from the DiVA database.

Show/hide year headlines.

Show/hide links to additional information.

## Journal papers

2022

Daniel Arnström, Alberto Bemporad, Daniel Axehill,
"A Dual Active-Set Solver for Embedded Quadratic Programming Using Recursive LDLT Updates",
IEEE Transactions on Automatic Control,
67(8):
4362-4369, 2022.

Daniel Arnström, Daniel Axehill,
"A Unifying Complexity Certification Framework for Active-Set Methods for Convex Quadratic Programming",
IEEE Transactions on Automatic Control,
67(6):
2758-2770, 2022.

Daniel Arnström, Alberto Bemporad, Daniel Axehill,
"A Linear Programming Method Based on Proximal-Point Iterations With Applications to Multi-Parametric Programming",
IEEE CONTROL SYSTEMS LETTERS,
6:
2066-2071, 2022.

2021

Daniel Arnström, Alberto Bemporad, Daniel Axehill,
"Complexity Certification of Proximal-Point Methods for Numerically Stable Quadratic Programming",
IEEE CONTROL SYSTEMS LETTERS,
5(4):
1381-1386, 2021.

2020

Daniel Arnström, Alberto Bemporad, Daniel Axehill,
"Exact Complexity Certification of a Nonnegative Least-Squares Method for Quadratic Programming",
IEEE CONTROL SYSTEMS LETTERS,
4(4):
1036-1041, 2020.

## Conference papers

2022

Shamisa Shoja, Daniel Arnström, Daniel Axehill,
"Overall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming",
2022 AMERICAN CONTROL CONFERENCE (ACC),
4957-4964, 2022.

2021

Daniel Arnström, Daniel Axehill,
"Semi-Explicit Linear MPC Using a Warm-Started Active-Set QP Algorithm with Exact Complexity Guarantees",
2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), IEEE Conference on Decision and Control,
2557-2562, 2021.

Daniel Arnström, Alberto Bemporad, Daniel Axehill,
"Complexity Certification of Proximal-Point Methods for Numerically Stable Quadratic Programming",
2021 AMERICAN CONTROL CONFERENCE (ACC), Proceedings of the American Control Conference,
947-952, 2021.

2020

Daniel Arnström, Daniel Axehill,
"Exact Complexity Certification of an Early-Terminating Standard Primal Active-Set Method for Quadratic Programming",
IFAC PAPERSONLINE,
6509-6515, 2020.

2019

Daniel Arnström, Daniel Axehill,
"Exact Complexity Certification of a Standard Primal Active-Set Method for Quadratic Programming",
2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), IEEE Conference on Decision and Control,
4317-4324, 2019.

## Theses

2021

Daniel Arnström,
"On Complexity Certification of Active-Set QP Methods with Applications to Linear MPC",
Linköping Studies in Science and Technology. Licentiate Thesis,
No. 1901,
2021.

## PhD Student in Automatic Control

**(Swedish: Doktorand i reglerteknik)**

**Phone:**- +46 76 8312409

**E-mail:**- daniel.arnstrom@liu.se

**Address:**- Dept. of Electrical Engineering
- Linköping University
- SE-581 83 Linköping
- Sweden

**Visiting Address:**- Campus Valla
- Building B
- Room 2A:504

Informationsansvarig: Daniel Arnström

Senast uppdaterad: 2018-09-11