Quadratic programming with ramp functions and fast online QP-MPC solutions

dc.contributor.author	Valmorbida, Giorgio
dc.contributor.author	Hovd, Morten
dc.date.accessioned	2023-12-29T10:29:34Z
dc.date.available	2023-12-29T10:29:34Z
dc.date.created	2023-04-24T12:57:42Z
dc.date.issued	2023
dc.identifier.citation	Automatica. 2023, 153 .	en_US
dc.identifier.issn	0005-1098
dc.identifier.uri	https://hdl.handle.net/11250/3109099
dc.description.abstract	A novel method is proposed for solving quadratic programming problems arising in model predictive control. The method is based on an implicit representation of the Karush–Kuhn–Tucker conditions using ramp functions. The method is shown to be highly efficient on both small and fairly large Quadratic Program problems, can be implemented using simple computer code, and has modest memory requirements.	en_US
dc.language.iso	eng	en_US
dc.publisher	Elsevier	en_US
dc.rights	Navngivelse 4.0 Internasjonal	*
dc.rights.uri	http://creativecommons.org/licenses/by/4.0/deed.no	*
dc.title	Quadratic programming with ramp functions and fast online QP-MPC solutions	en_US
dc.title.alternative	Quadratic programming with ramp functions and fast online QP-MPC solutions	en_US
dc.type	Peer reviewed	en_US
dc.type	Journal article	en_US
dc.description.version	acceptedVersion	en_US
dc.source.pagenumber	0	en_US
dc.source.volume	153	en_US
dc.source.journal	Automatica	en_US
dc.identifier.doi	10.1016/j.automatica.2023.111011
dc.identifier.cristin	2142871
cristin.ispublished	true
cristin.fulltext	postprint
cristin.qualitycode	2

Med mindre annet er angitt, så er denne innførselen lisensiert som Navngivelse 4.0 Internasjonal