A set-based framework for coherent model invalidation and parameter estimation of discrete time nonlinear systems

This work introduces a unified framework for model invalidation and parameter estimation for nonlinear systems. We consider a model given by implicit nonlinear difference equations that are polynomial in the variables. Experimental data is assumed to be available as possibly sparse, uncertain, but (set-)bounded measurements. The derived approach is based on the reformulation of the invalidation and parameter/state estimation tasks into a set-based feasibility problem. Exploiting the polynomial structure of the considered model class, the resulting non-convex feasibility problem is relaxed into a convex semi-definite one, for which infeasibility can be efficiently checked. The parameter/state estimation task is then reformulated as an outer-bounding problem. In comparison to other methods, we check for feasibility of whole parameter/state regions. The practicability of the proposed approach is demonstrated with two simple biological example systems.

[1]  Christian P. Robert,et al.  Monte Carlo Statistical Methods , 2005, Springer Texts in Statistics.

[2]  Lennart Ljung,et al.  Perspectives on system identification , 2010, Annu. Rev. Control..

[3]  Lennart Ljung,et al.  System Identification: Theory for the User , 1987 .

[4]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[5]  John Doyle,et al.  Model validation: a connection between robust control and identification , 1992 .

[6]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[7]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[8]  Irving R. Epstein,et al.  An Introduction to Nonlinear Chemical Dynamics: Oscillations, Waves, Patterns, and Chaos , 1998 .

[9]  L. Reichl,et al.  An Introduction to Nonlinear Chemical Dynamics: Oscillations, Waves, Patterns, and Chaos By Irving R. Epstein (Brandeis University) and John A. Pojman (University of S. Mississippi). Oxford University Press: New York. 1998. 408 pp. $75.00. ISBN 0-19-509670-3. , 2000 .

[10]  Pablo A. Parrilo,et al.  Efficient classification of complete parameter regions based on semidefinite programming , 2007, BMC Bioinformatics.

[11]  Maria Rodriguez-Fernandez,et al.  A hybrid approach for efficient and robust parameter estimation in biochemical pathways. , 2006, Bio Systems.

[12]  Philipp Rumschinski,et al.  Model discrimination and parameter estimation via infeasibility certificates for dynamical biochemical reaction networks , 2009 .

[13]  Philipp Rumschinski,et al.  Model invalidation and system identification of biochemical reaction networks , 2009 .

[14]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[15]  Axel Kowald,et al.  Systems Biology in Practice: Concepts, Implementation and Application , 2005 .

[16]  Petre Stoica,et al.  Decentralized Control , 2018, The Control Systems Handbook.

[17]  Frank Allgöwer,et al.  Guaranteed steady-state bounds for uncertain chemical processes , 2009 .

[18]  M. Ramana An algorithmic analysis of multiquadratic and semidefinite programming problems , 1994 .

[19]  David G. Luenberger,et al.  Linear and Nonlinear Programming: Second Edition , 2003 .

[20]  Santiago Schnell,et al.  The mechanism distinguishability problem in biochemical kinetics: the single-enzyme, single-substrate reaction as a case study. , 2006, Comptes rendus biologies.

[21]  A. Cornish-Bowden Fundamentals of Enzyme Kinetics , 1979 .

[22]  S. Prajna Barrier certificates for nonlinear model validation , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).