Sökning: id:"swepub:oai:DiVA.org:liu-180776" >
Complexity Certific...
Complexity Certification of Proximal-Point Methods for Numerically Stable Quadratic Programming
-
- Arnström, Daniel (författare)
- Linköpings universitet,Reglerteknik,Tekniska fakulteten
-
- Bemporad, Alberto (författare)
- IMT Sch Adv Studies Lucca, Italy
-
- Axehill, Daniel (författare)
- Linköpings universitet,Reglerteknik,Tekniska fakulteten
-
(creator_code:org_t)
- IEEE, 2021
- 2021
- Engelska.
-
Ingår i: 2021 AMERICAN CONTROL CONFERENCE (ACC). - : IEEE. - 9781665441971 ; , s. 947-952
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.2...
-
visa färre...
Abstract
Ämnesord
Stäng
- When solving a quadratic program (QP), one can improve the numerical stability of any QP solver by performing proximal-point outer iterations, resulting in solving a sequence of better conditioned QPs. In this paper we present a method which, for a given multi-parametric quadratic program (mpQP) and any polyhedral set of parameters, determines which sequences of QPs will have to be solved when using outer proximal-point iterations. By knowing this sequence, bounds on the worst-case complexity of the method can be obtained, which is of importance in, for example, real-time model predictive control (MPC) applications. Moreover, we combine the proposed method with previous work on complexity certification for active-set methods to obtain a more detailed certification of the proximal-point methods complexity, namely the total number of inner iterations.
Ämnesord
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas