Atya Elsheikh
Research Center Jülich, Institute of Biotechnology, Germany
Katharina Nöh
Research Center Jülich, Institute of Biotechnology, Germany
Eric von Lieres
Research Center Jülich, Institute of Biotechnology, Germany
Download articlehttp://dx.doi.org/10.3384/ecp09430039Published in: Proceedings of the 7th International Modelica Conference; Como; Italy; 20-22 September 2009
Linköping Electronic Conference Proceedings 43:6, p. 47-55
Published: 2009-12-29
ISBN: 978-91-7393-513-5
ISSN: 1650-3686 (print), 1650-3740 (online)
Derivative-based optimization methods for parameter estimation require good start values in order to converge to the global optimum. A conventional multistart strategy is often not practical for identifying such start values; especially for high dimensional problems. Moreover; the computational efforts for each iteration of the optimizer are significantly increased by the computation of parameter sensitivities. We hence present a multistart recursive clustering strategy that utilizes DAE decomposition algorithms; in particular Tarjan’s and tearing algorithms. These algorithms are also used by standard Modelica compilers for improving the performance of solving large DAE systems. Our key concept
is to provide a natural decomposition of the parameter estimation problem into smaller clusters (i.e. subproblems); each of which requires fewer start values and less computation. The resulting local minima are taken as start values for enlarged subproblems; and so forth until good start values for the original problem are found. This approach serves to improve global convergence and computational speed of multistart derivative-based optimization strategies for large sparse DAE systems.
Parameter estimation; global optimization; cluster methods; DAE decomposition algorithms
[1] A. Antoniou; W. Lu. Practical Optimization; Algorithms and Engineering Applications; Springer Verlag; 2007.
[2] J. Nocedal; S. J. Wright. Numerical Optimization; Springer Series in Operations Research; 2000.
[3] A. Elsheikh and W. Wiechert. Automatic sensitivity analysis of DAE systems generated from equation-based modeling languages. Pages 235-246 in C. H.
Bischof; et al. (editors). Advances in Automatic Differentiation. Springer; 2008.
[4] A. Elsheikh; S. Noack and W. Wiechert. Sensitivity analysis of Modelica applications via automatic differentiation. In 6th International Modelica
Conference; Bielefeld; Germany; March 3-4; 2008.
[5] A. Griewank. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation; Frontiers in Applied Mathematics; SIAM; 2000.
[6] X. Ke. Tools for sensitivity analysis of Modelica models; Master Thesis; University of Siegen; 2009.
[7] F. E. Cellier. Continuous System Modeling. Springer Verlag; 1991. doi: 10.1007/978-1-4757-3922-0
[8] K. Murota. Systems Analysis by Graphs and Matroids; Springer Verlag; 1987. doi: 10.1007/978-3-642-61586-3
[9] R. Tarjan. Depth-First Search and Linear Graph Algorithms; SIAM Journal on Computing 1(1972): 146-160. doi: 10.1137/0201010
[10] H. Elmqvist and M. Otter. Methods for tearing systems of equations in object oriented modeling. In ESM’94 European Simulation Multiconference;
Barcelona; Spain; June 1-3 1994.
[11] G. Kron. Diakoptics - The piecewise solution of large-scale systems. MacDonald & Co. London; 1963.
[12] E. Özcan; B. Bilgin; and E. E. Korkamz. A comprehensive analysis of hyper-heuristics; Intelligent Data Analysis 12 (2008): 3-23.
[13] C. Voglis and I.E. Lagaris. Towards ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain.
Applied Mathematics and Computation 213 (2009): 216-229.