.png){kind=icon}
返回
A Linear Programming Approach to Parameter Fitting for the Master Equation
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2009.2029307.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Markov process
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
分享收藏
没有更多内容
没有更多内容