Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Parallel Solution of Large-Scale Dynamic Optimization Problems

Författare

  • 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.

Publiceringsår

2011

Språk

Engelska

Dokumenttyp

Konferensbidrag

Ämne

  • Control Engineering

Nyckelord

  • 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

Forskningsgrupp

  • LCCC