Interior-point algorithms for nonlinear model predictive control
Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review
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.
| Original language | Unknown |
|---|---|
| Title of host publication | Lecture Notes in Control and Information Sciences |
| Publisher | Springer |
| Pages | 207-216 |
| Number of pages | 10 |
| Volume | 358 |
| Edition | 1 |
| Publication status | Published - 2007 |
| Externally published | Yes |
Publication series
| Name | Lecture Notes in Control and Information Sciences |
|---|