Interior-point algorithms for nonlinear model predictive control
Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review
Standard Standard
Lecture Notes in Control and Information Sciences. Vol. 358 1. ed. Springer, 2007. p. 207-216 (Lecture Notes in Control and Information Sciences).
Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review
HarvardHarvard
APA
CBE
MLA
VancouverVancouver
Author
RIS
TY - CHAP
T1 - Interior-point algorithms for nonlinear model predictive control
AU - Wills, A.G.
AU - Heath, W.P.
PY - 2007
Y1 - 2007
N2 - In this contribution we present two interior-point path-following algorithms that solve the convex optimisation problem that arises in recentred barrier function model predictive control (MPC), which includes standard MPC as a limiting case. However the optimisation problem that arises in nonlinear MPC may not be convex. In this case we propose sequential convex programming (SCP) as an alternative to sequential quadratic programming. The algorithms are appropriate for the convex program that arises at each iteration of such an SCP.
AB - In this contribution we present two interior-point path-following algorithms that solve the convex optimisation problem that arises in recentred barrier function model predictive control (MPC), which includes standard MPC as a limiting case. However the optimisation problem that arises in nonlinear MPC may not be convex. In this case we propose sequential convex programming (SCP) as an alternative to sequential quadratic programming. The algorithms are appropriate for the convex program that arises at each iteration of such an SCP.
M3 - Pennod
VL - 358
T3 - Lecture Notes in Control and Information Sciences
SP - 207
EP - 216
BT - Lecture Notes in Control and Information Sciences
PB - Springer
ER -