Oops! I cannot do it again: Testing for recursive feasibility in MPC
- 1 March 2012
- journal article
- research article
- Published by Elsevier BV in Automatica
- Vol. 48 (3), 550-555
- https://doi.org/10.1016/j.automatica.2011.12.003
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Controlled invariant feasibility — A general approach to enforcing strong feasibility in MPC applied to move-blockingAutomatica, 2009
- Move blocking strategies in receding horizon controlJournal of Process Control, 2007
- A polyhedral branch-and-cut approach to global optimizationMathematical Programming, 2005
- SNOPT: An SQP Algorithm for Large-Scale Constrained OptimizationSiam Review, 2005
- Constrained model predictive control: Stability and optimalityAutomatica, 2000
- Set invariance in controlAutomatica, 1999
- Generalized bilinear programming: Part I. Models, applications and linear programming relaxationEuropean Journal of Operational Research, 1992
- A Branch and Bound Algorithm for the Bilevel Programming ProblemSIAM Journal on Scientific and Statistical Computing, 1990
- The polynomial hierarchy and a simple model for competitive analysisMathematical Programming, 1985
- A Representation and Economic Interpretation of a Two-Level Programming ProblemJournal of the Operational Research Society, 1981