  


Efficient Convex Optimization for Linear MPC
Stephen J. Wright(swrightcs.wisc.edu) Abstract: Model predictive control (MPC) formulations with linear dynamics and quadratic objectives can be solved efficiently by using a primaldual interiorpoint framework, with complexity proportional to the length of the horizon. An alternative, which is more able to exploit the similarity of the problems that are solved at each decision point of linear MPC, is to use an activeset approach, in which the MPC problem is viewed as a convex quadratic program that is parametrized by the initial state $x_0$. Another alternative is to identify explicitly polyhedral regions of the space occupied by $x_0$ within which the set of active constraints remains constant, and to precalculate solution operators on each of these regions. All these approaches are discussed here. Keywords: Model Predictive Control, Quadratic Programming Category 1: Applications  Science and Engineering (Control Applications ) Category 2: Nonlinear Optimization (Quadratic Programming ) Citation: To appear in "Handbook of Model Predictive Control," 2018. Download: [PDF] Entry Submitted: 11/28/2017 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  