Parallel sensitivity analysis for efficient large‐scale dynamic optimization

Parallel sensitivity analysis for efficient large‐scale dynamic optimization

0.00 Avg rating0 Votes
Article ID: iaor201110215
Volume: 12
Issue: 4
Start Page Number: 489
End Page Number: 508
Publication Date: Dec 2011
Journal: Optimization and Engineering
Authors: , , , ,
Keywords: differential equations, 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 computed separately by other processes. The computational effort for a combined state and sensitivity integration can almost be reduced to the computational effort of the pure state integration, which is the theoretical limit of the suggested approach.

Reviews

Required fields are marked *. Your email address will not be published.