2010
DOI: 10.1007/s11081-010-9104-4
|View full text |Cite
|
Sign up to set email alerts
|

Parallel sensitivity analysis for efficient large-scale dynamic optimization

Abstract: An efficient parallel algorithm for the computation of parametric sensitivities for differential-algebraic equations (DAEs) with a focus on dynamic optimization problems is presented. A speedup of about 4 can be obtained for process models of more than 13500 DAEs and 75 parameters employing 8 processor cores in parallel using a Windows based system. The algorithm obtains its efficiency by decoupling the sensitivity equations from the state equations of the DAE. Furthermore, the costly Jacobian matrices are com… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(10 citation statements)
references
References 21 publications
0
10
0
Order By: Relevance
“…It is worthy to note, that these elements are independent and computing of each element needs the objective or constraint function evaluation [16].…”
Section: Sensitivity Calculationsmentioning
confidence: 99%
“…It is worthy to note, that these elements are independent and computing of each element needs the objective or constraint function evaluation [16].…”
Section: Sensitivity Calculationsmentioning
confidence: 99%
“…Many large‐scale differential equation solvers provide state sensitivities via forward sensitivity analysis or possibly adjoint (reverse) sensitivity analysis, and the particular numerical methods/techniques used to compute this information are highly important in terms of both solution accuracy and speed when using large‐scale chemical process engineering models . Due to the direct presence of the state variables x(tj+1) in the continuity constraints, a natural approach to generate the optimization function derivatives is forward sensitivity analysis.…”
Section: Optimization Solution Frameworkmentioning
confidence: 99%
“…In terms of advancing the state of direct dynamic optimization solution techniques such that larger plant‐wide models can be used, recent work has focused on parallel implementations for: (1) the sensitivity computation within the sequential approach; (2) the embedded model and sensitivity solution over each shooting interval within the multiple‐shooting algorithm; and (3) the structured linear algebra of the Karush–Kuhn–Tucker system solution for the interior‐point (IP) NLP algorithm, used within the simultaneous method . Furthermore, with scenario‐based solution strategies for handling uncertainty, many past implementations have been serial with no exploitation of parallelism for the multiple periods/scenarios used.…”
Section: Introductionmentioning
confidence: 99%
“…Vector data, structured and complex, small storage space needed, spatial location accuracy, is difficult to overlay polygon analysis; raster data with simple data organization and attribute obviously take advantage of comprehensive overlay analysis of spatial information such as Space simulation and space overlay [7][8].…”
Section: ) Rasterizationmentioning
confidence: 99%