Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Parallel Solution of Large-Scale Dynamic Optimization Problems

Författare:
  • Carl Laird
  • Angelica Wong
  • Johan Åkesson
Publiceringsår: 2011
Språk: Engelska
Dokumenttyp: Konferensbidrag

Sammanfattning

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.

Nyckelord

  • Control Engineering
  • Dynamic optimization
  • parallel computing
  • collocation

Övriga

21st European Symposium on Computer Aided Process Engineering, 2011
Published
  • LCCC-lup-obsolete

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu.se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen