Towards Dynamic Optimization with Partially Updated Sensitivities KU Leuven
In nonlinear model predictive control (NMPC), a control task is approached by repeatedly solving an optimal control problem (OCP) over a receding horizon. Popularly, the OCP is approximated with a finite-dimensional nonlinear program (NLP). Since computing the solution of an NLP can be a complex and time-consuming task, tailored optimization algorithms have emerged to (approximately) solve the NLPs. Most methods rely on repeatedly solving a ...