A note on the convergence rate of the value iteration scheme in controlled Markov chains
โ Scribed by Rolando Cavazos-Cadena
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 106 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This work concerns average Markov decision chains with denumerable state space. Assuming that the Lyapunov function condition holds, it is shown that the value iteration scheme yields convergent approximations to the solution of the average cost optimality equation. This result is obtained using a p
It is well known that successive overrelaxation (SOR) can be used to compute the stationary distribution of a homogeneous Markov chain. In a long paper Kontovasalis et al. (K. Kontovasalis, R.J. Plemmons, W.J. Stewart, Linear Algebra Appl. 154-156 (1991) showed together with other results that for p
Control schemes such as cumulative sum (CUSUM), exponentially weighted moving average (EWMA) and Shewhart charts have found widespread application in improving the quality of manufactured goods and services. The run length and the average run length (ARL) have become traditional measures of a contro
Many stochastic models in queueing, inventory, communications, and dam theories, etc., result in the problem of numerically determining the minimal nonnegative solutions for a class of nonlinear matrix equations. Various iterative methods have been proposed to determine the matrices of interest. We