Efficient solution of dynamic optimization and NMPC problems (Q4952756)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1445430
Language Label Description Also known as
default for all languages
No label defined
    English
    Efficient solution of dynamic optimization and NMPC problems
    scientific article; zbMATH DE number 1445430

      Statements

      20 August 2001
      0 references
      Newton-type methods
      0 references
      nonlinear programming
      0 references
      nonlinear model predictive control
      0 references
      successive quadratic programming
      0 references
      data reconciliation
      0 references
      parameter estimation
      0 references
      0 references
      Efficient solution of dynamic optimization and NMPC problems (English)
      0 references
      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].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references