A. Malyshev, R. Quirynen, A. Knyazev, S. D. Cairano
{"title":"A regularized Newton solver for linear model predictive control","authors":"A. Malyshev, R. Quirynen, A. Knyazev, S. D. Cairano","doi":"10.23919/ECC.2018.8550438","DOIUrl":null,"url":null,"abstract":"We investigate direct numerical solvers in linear model predictive control, where the prediction model is given by linear systems subject to linear inequality constraints on the state and the input, and the performance index is convex and quadratic. The inequality constraints are treated by the primal-dual interior-point method. We propose a novel direct solver based on the augmented Lagrangian regularization of a reduced Hessian. The new solver has the same arithmetic complexity as the factorized Riccati recursion. The direct solver can be implemented in terms of BLAS3 matrix operations.","PeriodicalId":222660,"journal":{"name":"2018 European Control Conference (ECC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 European Control Conference (ECC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ECC.2018.8550438","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
We investigate direct numerical solvers in linear model predictive control, where the prediction model is given by linear systems subject to linear inequality constraints on the state and the input, and the performance index is convex and quadratic. The inequality constraints are treated by the primal-dual interior-point method. We propose a novel direct solver based on the augmented Lagrangian regularization of a reduced Hessian. The new solver has the same arithmetic complexity as the factorized Riccati recursion. The direct solver can be implemented in terms of BLAS3 matrix operations.