The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Parallel Solution of Large-Scale Dynamic Optimization Problems

På svenska

Author

  • Carl Laird
  • Angelica Wong
  • Johan Åkesson

Summary, in English

This paper presents a decomposition strategy applicable to DAE constrained optimization problems. A common solution method for such problems is to apply a direct transcription method and to solve the resulting non-linear program using an interior point algorithm, where the time to solve the linearized KKT system at each iteration is dominating the total solution time. In the proposed method, the structure of the KKT system resulting from a direct collocation scheme for approximating the DAE constraint is exploited in order to distribute the required linear algebra operations on multiple processors. A prototype implementation applied to benchmark models shows promising results.

Publishing year

2011

Language

English

Document type

Conference paper

Topic

  • Control Engineering

Keywords

  • Dynamic optimization
  • parallel computing
  • collocation

Conference name

21st European Symposium on Computer Aided Process Engineering, 2011

Conference date

2011-05-29 - 2011-06-01

Conference place

Chalkidiki, Greece

Status

Published

Research group

  • LCCC