Bounding stationary averages of polynomial diffusions via semidefinite programming

Abstract

We introduce an algorithm based on semidefinite programming that yields increasing (resp. decreasing) sequences of lower (resp. upper) bounds on polynomial stationary averages of diffusions with polynomial drift vector and diffusion coefficients. The bounds are obtained by optimising an objective, determined by the stationary average of interest, over the set of real vectors defined by certain linear equalities and semidefinite inequalities which are satisfied by the moments of any stationary measure of the diffusion. We exemplify the use of the approach through several applications: a Bayesian inference problem; the computation of Lyapunov exponents of linear ordinary differential equations perturbed by multiplicative white noise; and a reliability problem from structural mechanics. Additionally, we prove that the bounds converge to the infimum and supremum of the set of stationary averages for certain SDEs associated with the computation of the Lyapunov exponents, and we provide numerical evidence of convergence in more general settings.

Cited by in corpus (12)

• Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization
• Bounding extreme events in nonlinear dynamics using convex optimization
• Rigorous bounds on the stationary distributions of the chemical master equation via mathematical programming
• Relationship between the methods of bounding time averages
• Auxiliary Functions as Koopman Observables: Data-Driven Analysis of Dynamical Systems via Polynomial Optimization
• Finding extremal periodic orbits with polynomial optimisation, with application to a nine-mode model of shear flow
• A Convex Approach to Steady State Moment Analysis for Stochastic Chemical Reactions
• Stationary distributions of continuous-time Markov chains: a review of theory and truncation-based approximations
• A study of the double pendulum using polynomial optimization
• Minimum wave speeds in monostable reaction-diffusion equations: sharp bounds by polynomial optimization
• Data-driven Discovery of Invariant Measures
• Sum-of-squares bounds on correlation functions in a minimal model of turbulence