Efficient solution of dynamic optimization and NMPC problems

From MaRDI portal





A number of recent developments and computational trends for the solution to nonlinear programming (NLP) problems which have the characteristics of nonlinear model predictive control (NMPC) strategies are highlighted in order to overcome current limitations and to introduce latest findings. The topics include definition of the general NLP problem, a Newton-based algorithm for the solution of NLPs together with some convergence properties along the NMPC strategies, sequential and simultaneous solution approaches, exploitation of the structure of the NMPC problem, inequality constraint handling. It is shown that most advances in NLP algorithms have taken place by recognizing and exploiting the framework of successive quadratic programming (SQP). Very fast NLP algorithms can be derived on the basis of SQP for data reconciliation, parameter estimation, NMPC, and dynamic optimization. With the availability of good NLP solvers, the most challenging applications are outlined. For the entire collection see [Zbl 0934.00030].











This page was built for publication: Efficient solution of dynamic optimization and NMPC problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952756)