Model complexity reduction of chemical reaction networks using mixed-integer quadratic programming

Ralf Hannemann-Tamás, Attila Gábor, G. Szederkényi, K. Hangos

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

The model complexity reduction problem of large chemical reaction networks under isobaric and isothermal conditions is considered. With a given detailed kinetic mechanism and measured data of the key species over a finite time horizon, the complexity reduction is formulated in the form of a mixed-integer quadratic optimization problem where the objective function is derived from the parametric sensitivity matrix. The proposed method sequentially eliminates reactions from the mechanism and simultaneously tunes the remaining parameters until the pre-specified tolerance limit in the species concentration space is reached. The computational efficiency and numerical stability of the optimization are improved by a pre-reduction step followed by suitable scaling and initial conditioning of the Hessian involved. The proposed complexity reduction method is illustrated using three well-known case studies taken from reaction kinetics literature.

Original languageEnglish
Pages (from-to)1575-1595
Number of pages21
JournalComputers and Mathematics with Applications
Volume65
Issue number10
DOIs
Publication statusPublished - 2013

Fingerprint

Chemical Reaction Networks
Model Complexity
Quadratic programming
Integer Programming
Quadratic Programming
Chemical reactions
Tolerance Limits
Quadratic Optimization
Reaction Kinetics
Numerical Stability
Reduction Method
Conditioning
Computational Efficiency
Horizon
Convergence of numerical methods
Eliminate
Objective function
Computational efficiency
Kinetics
Reaction kinetics

Keywords

  • Chemical reaction networks
  • Mixed-integer quadratic programming
  • Model reduction
  • Sensitivity analysis

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Modelling and Simulation
  • Computational Mathematics

Cite this

Model complexity reduction of chemical reaction networks using mixed-integer quadratic programming. / Hannemann-Tamás, Ralf; Gábor, Attila; Szederkényi, G.; Hangos, K.

In: Computers and Mathematics with Applications, Vol. 65, No. 10, 2013, p. 1575-1595.

Research output: Contribution to journalArticle

@article{b5719e7e80c640af95dbb67ec15f1bfb,
title = "Model complexity reduction of chemical reaction networks using mixed-integer quadratic programming",
abstract = "The model complexity reduction problem of large chemical reaction networks under isobaric and isothermal conditions is considered. With a given detailed kinetic mechanism and measured data of the key species over a finite time horizon, the complexity reduction is formulated in the form of a mixed-integer quadratic optimization problem where the objective function is derived from the parametric sensitivity matrix. The proposed method sequentially eliminates reactions from the mechanism and simultaneously tunes the remaining parameters until the pre-specified tolerance limit in the species concentration space is reached. The computational efficiency and numerical stability of the optimization are improved by a pre-reduction step followed by suitable scaling and initial conditioning of the Hessian involved. The proposed complexity reduction method is illustrated using three well-known case studies taken from reaction kinetics literature.",
keywords = "Chemical reaction networks, Mixed-integer quadratic programming, Model reduction, Sensitivity analysis",
author = "Ralf Hannemann-Tam{\'a}s and Attila G{\'a}bor and G. Szederk{\'e}nyi and K. Hangos",
year = "2013",
doi = "10.1016/j.camwa.2012.11.024",
language = "English",
volume = "65",
pages = "1575--1595",
journal = "Computers and Mathematics with Applications",
issn = "0898-1221",
publisher = "Elsevier Limited",
number = "10",

}

TY - JOUR

T1 - Model complexity reduction of chemical reaction networks using mixed-integer quadratic programming

AU - Hannemann-Tamás, Ralf

AU - Gábor, Attila

AU - Szederkényi, G.

AU - Hangos, K.

PY - 2013

Y1 - 2013

N2 - The model complexity reduction problem of large chemical reaction networks under isobaric and isothermal conditions is considered. With a given detailed kinetic mechanism and measured data of the key species over a finite time horizon, the complexity reduction is formulated in the form of a mixed-integer quadratic optimization problem where the objective function is derived from the parametric sensitivity matrix. The proposed method sequentially eliminates reactions from the mechanism and simultaneously tunes the remaining parameters until the pre-specified tolerance limit in the species concentration space is reached. The computational efficiency and numerical stability of the optimization are improved by a pre-reduction step followed by suitable scaling and initial conditioning of the Hessian involved. The proposed complexity reduction method is illustrated using three well-known case studies taken from reaction kinetics literature.

AB - The model complexity reduction problem of large chemical reaction networks under isobaric and isothermal conditions is considered. With a given detailed kinetic mechanism and measured data of the key species over a finite time horizon, the complexity reduction is formulated in the form of a mixed-integer quadratic optimization problem where the objective function is derived from the parametric sensitivity matrix. The proposed method sequentially eliminates reactions from the mechanism and simultaneously tunes the remaining parameters until the pre-specified tolerance limit in the species concentration space is reached. The computational efficiency and numerical stability of the optimization are improved by a pre-reduction step followed by suitable scaling and initial conditioning of the Hessian involved. The proposed complexity reduction method is illustrated using three well-known case studies taken from reaction kinetics literature.

KW - Chemical reaction networks

KW - Mixed-integer quadratic programming

KW - Model reduction

KW - Sensitivity analysis

UR - http://www.scopus.com/inward/record.url?scp=84878526661&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878526661&partnerID=8YFLogxK

U2 - 10.1016/j.camwa.2012.11.024

DO - 10.1016/j.camwa.2012.11.024

M3 - Article

AN - SCOPUS:84878526661

VL - 65

SP - 1575

EP - 1595

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

SN - 0898-1221

IS - 10

ER -