A Linear Programming Approach to Parameter Fitting for the Master Equation

doi:10.1109/TAC.2009.2029307

Return

A Linear Programming Approach to Parameter Fitting for the Master Equation

2009-10-01

PRE

Nuno C. Martins *

Jorge Gonçalves

DOI：10.1109/TAC.2009.2029307

Original

Original request for help

Save

Abstract

En 中文

This technical note proposes a new framework for the design of continuous time, finite state space Markov processes. In particular, we propose a paradigm for selecting an optimal matrix within a pre-specified pencil of transition rate matrices. Given any transition rate matrix specifying the lime-evolution of the Markov process, we propose a class of figures of merit that upper-bounds the long-term evolution of any statistical moment. We show that optimization with respect to the aforementioned class of cost functions is tractable via dualization and linear programming methods. In addition, we suggest how this approach can be used as a tool for the sub-optimal design of the master equation, with performance guarantees. Our results are applied to illustrative examples.

Keywords:

Markov process

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.