Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


Computational Complexity Certification


S. Richter

SIAM Conference on Optimization, Darmstadt, Germany, SIOPT 2011

MPC requires the solution of a constrained finite horizon optimal control problem in a receding horizon fashion. Consequently, the solution to this optimization problem has to be obtained within one sampling period of the con- trol loop. But guaranteeing deterministic termination of iterative solution methods is a challenging problem in gen- eral. This talk focuses on certifying Nesterovís fast gradient method for constrained linear quadratic MPC and points out links between problem data and convergence speed.


Type of Publication:


M. Morari

File Download:

Request a copy of this publication.
(Uses JavaScript)
% No recipe for automatically generating a BibTex entry for (06)Talk
Permanent link