HPIPM: a high-performance quadratic programming framework for model predictive control
Abstract: This paper introduces HPIPM, a high-performance framework for quadratic programming (QP), designed to provide building blocks to efficiently and reliably solve model predictive control problems. HPIPM currently supports three QP types, and provides interior point method (IPM) solvers as well (partial) condensing routines. In particular, the IPM for optimal control QPs is intended to supersede the HPMPC solver, and it largely improves robustness while keeping the focus on speed. Numerical experiments show that HPIPM reliably solves challenging QPs, and that it outperforms other state-of-the-art solvers in speed
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
IFAC-PapersOnLine. - 53, 2 (2020) , 6563-6569, ISSN: 2405-8963
- Klassifikation
-
Zeitschriften, fortlaufende Sammelwerke
- Ereignis
-
Veröffentlichung
- (wo)
-
Freiburg
- (wer)
-
Universität
- (wann)
-
2025
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.1016/j.ifacol.2020.12.073
- URN
-
urn:nbn:de:bsz:25-freidok-2618540
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:27 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Frison, Gianluca
- Diehl, Moritz
- Albert-Ludwigs-Universität Freiburg. Lehrstuhl für Systemtheorie, Regelungstechnik und Optimierung
- Universität
Entstanden
- 2025
Ähnliche Objekte (12)
AnyDSL: A partial evaluation framework for programming high-performance libraries
Quadratic programming by spiking neuronal networks
Quadratic programming : complexity issues in real number models
Integral methods for quadratic programming : theory and implementation
Tableau-based protein substructure search using quadratic programming
New bounds for nonconvex quadratically constrained quadratic programming
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Language Support for Programming High-Performance Code
Noncooperative Model Predictive Control for Affine-Quadratic Games
An algorithm for indefinite quadratic programming with convex constraints
MINQ8: general definite and bound constrained indefinite quadratic programming
AnyDSL: A partial evaluation framework for programming high-performance libraries
Quadratic programming by spiking neuronal networks
Quadratic programming : complexity issues in real number models
Integral methods for quadratic programming : theory and implementation
Tableau-based protein substructure search using quadratic programming
New bounds for nonconvex quadratically constrained quadratic programming
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Language Support for Programming High-Performance Code
Noncooperative Model Predictive Control for Affine-Quadratic Games
An algorithm for indefinite quadratic programming with convex constraints
MINQ8: general definite and bound constrained indefinite quadratic programming
AnyDSL: A partial evaluation framework for programming high-performance libraries
Quadratic programming by spiking neuronal networks
Quadratic programming : complexity issues in real number models
Integral methods for quadratic programming : theory and implementation
Tableau-based protein substructure search using quadratic programming
New bounds for nonconvex quadratically constrained quadratic programming
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Language Support for Programming High-Performance Code
Noncooperative Model Predictive Control for Affine-Quadratic Games
An algorithm for indefinite quadratic programming with convex constraints