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.

  

A variant to Sequential Quadratic Programming for Nonlinear Model Predictive Control

Author(s):

G. Torrisi, S. Grammatico, R. S. Smith, M. Morari
Conference/Journal:

IEEE Conference on Decision and Control, pp. 2814-2819
Abstract:

Sequential Quadratic Programming (SQP) denotes an established class of methods for solving nonlinear optimization problems via an iterative sequence of Quadratic Programs (QPs). Several approaches in the literature have established local and global convergence of the method. This paper considers a variant to SQP that, instead of solving each QP, at each iteration follows one gradient step along a direction that is proven to be a descent direction for an augmented Lagrangian of the nonlinear problem, and in turn is used to generate the next QP. We prove global convergence to a critical point of the original nonlinear problem via a line search that requires the same assumptions as the SQP method. The method is then applied to nonlinear Model Predictive Control (MPC). To simplify the problem formulation and achieve faster convergence, we propose a locally convergent reformulation. An important speed-up is observed in practice via a specific initialization. The computational efficiency of the proposed method is finally shown in a numerical example.

Year:

2016
Type of Publication:

(01)Article
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { TorEtal:2016:IFA_5508,
    author={G. Torrisi and S. Grammatico and R. S. Smith and M. Morari},
    title={{A variant to Sequential Quadratic Programming for Nonlinear
	  Model Predictive Control}},
    booktitle={IEEE Conference on Decision and Control},
    pages={2814--2819},
    year={2016},
    address={},
    month=dec,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=5508}
}
Permanent link