Tighter bounds on transient moments of stochastic chemical systems
From MaRDI portal
Publication:6182326
DOI10.1007/S10957-023-02335-9arXiv2104.01309OpenAlexW3143210723MaRDI QIDQ6182326FDOQ6182326
Paul I. Barton, Flemming Holtorf
Publication date: 25 January 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Abstract: The use of approximate solution techniques for the Chemical Master Equation is common practice for the analysis of stochastic chemical systems. Despite their widespread use, however, many such techniques rely on unverifiable assumptions and only few provide mechanisms to control the approximation error quantitatively. Addressing this gap, Dowdy and Barton [The Journal of Chemical Physics, 149(7), 074103 (2018)] proposed a method for the computation of guaranteed bounds on the moment trajectories associated with stochastic chemical systems described by the Chemical Master Equation, thereby providing a general framework for error quantification. Here, we present an extension of this method. The key contribution is a new hierarchy of convex necessary moment conditions crucially reflecting the temporal causality and other regularity conditions that are inherent to the moment trajectories associated with stochastic processes described by the Chemical Master Equation. Analogous to the original method, these conditions generate a hierarchy of semidefinite programs that furnishes monotonically improving bounds on the trajectories of the moments and related statistics. Compared to its predecessor, the presented hierarchy produces bounds that are at least as tight and it often enables the computation of dramatically tighter bounds as it enjoys superior scaling properties and the generated semidefinite programs are highly structured. We analyze the properties of the presented hierarchy, discuss some aspects of its practical implementation and demonstrate its merits with several examples.
Full work available at URL: https://arxiv.org/abs/2104.01309
polynomial optimizationsemidefinite programmingoptimal controlstochastic chemical kineticsstochastic reaction networksbiochemical systemsmoment-sum-of-squares hierarchy
Cites Work
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- JuMP: A Modeling Language for Mathematical Optimization
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Occupation measures for controlled Markov processes: Characterization and optimality
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Convex Computation of the Region of Attraction of Polynomial Control Systems
- Title not available (Why is that?)
- Polynomials that are positive on an interval
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- Bounds on linear PDEs via semidefinite optimization
- Title not available (Why is that?)
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Title not available (Why is that?)
- PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- Title not available (Why is that?)
- An extension of the moment closure method
- Computing Moments of the Exit Time Distribution for Markov Processes by Linear Programming
- Title not available (Why is that?)
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Interval analysis of worst-case stationary moments for stochastic chemical reactions with uncertain parameters
- On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- Title not available (Why is that?)
- Decentralized Schemes With Overlap for Solving Graph-Structured Optimization Problems
- Bounding Stationary Averages of Polynomial Diffusions via Semidefinite Programming
- A Geometrical Characterization of Multidimensional Hausdorff Polytopes with Applications to Exit Time Problems
- Time-Varying Semidefinite Programs
- On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control
- Revisiting Semidefinite Programming Approaches to Options Pricing: Complexity and Computational Perspectives
This page was built for publication: Tighter bounds on transient moments of stochastic chemical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182326)
