Oops! I cannot do it again: testing for recursive feasibility in MPC

DOI10.1016/j.automatica.2011.12.003zbMath1244.93090OpenAlexW1990311592MaRDI QIDQ445103

Johan Löfberg

Publication date: 24 August 2012

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2011.12.003

zbMATH Keywords

predictive controlbilevel programmingconstrained controlFarkas' Lemmalack of stability and feasibility

Mathematics Subject Classification ID

Related Items (5)

A fast dissipative robust nonlinear model predictive control procedure via quasi‐linear parameter varying embedding and parameter extrapolation ⋮ LMI-based robust mixed-integer model predictive control for hybrid systems ⋮ Terminal inventory level constraints for online production scheduling ⋮ Large-scale dynamic system optimization using dual decomposition method with approximate dynamic programming ⋮ A predictive fault tolerant control method for qLPV systems subject to input faults and constraints

Uses Software

• SNOPT
• YALMIP
• MPT

Cites Work

• Unnamed Item
• Unnamed Item
• Bilevel programming: a survey
• Controlled invariant feasibility - a general approach to enforcing strong feasibility in MPC applied to move-blocking
• Generalized bilinear programming. I: Models, applications and linear programming relaxation
• A polyhedral branch-and-cut approach to global optimization
• Set invariance in control
• Constrained model predictive control: Stability and optimality
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• The polynomial hierarchy and a simple model for competitive analysis
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• Hybrid Systems: Computation and Control
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

This page was built for publication: Oops! I cannot do it again: testing for recursive feasibility in MPC