Low-Complexity First-Order Constraint Linearization Methods for Efficient Nonlinear MPC
| Author(s): G. Torrisi, S. Grammatico, D. Frick, T. Robbiani, R. S. Smith, M. Morari |
Conference/Journal: IEEE Conference on Decision and Control, no. 4376-4381, [OC:08814,03416] |
| Abstract: In this paper, we analyze first-order methods to find a KKT point of the nonlinear optimization problems arising in Model Predictive Control (MPC). The methods are based on a projected gradient and constraint linearization approach, that is, every iteration is a gradient step, projected onto a linearization of the constraints around the current iterate. We introduce an approach that uses a simple `p merit function, which has the computational advantage of not requiring any estimate of the dual variables and keeping the penalty parameter bounded. We then prove global convergence of the proposed method to a KKT point of the nonlinear problem. The first-order methods can be readily implemented in practice via the novel tool FalcOpt. The performance is then illustrated on numerical examples and compared with conventional methods. | Year: 2017 |
| Type of Publication: (01)Article | |
| Supervisor: | |
% Autogenerated BibTeX entry
@InProceedings { TorEtal:2017:IFA_5728,
author={G. Torrisi and S. Grammatico and D. Frick and T. Robbiani and R. S.
Smith and M. Morari},
title={{Low-Complexity First-Order Constraint Linearization Methods
for Efficient Nonlinear MPC}},
booktitle={IEEE Conference on Decision and Control},
pages={},
year={2017},
address={},
month=dec,
url={https://old.control.ee.ethz.ch/index.cgi?page=publications;action=details;id=5728}
} | |