Generic rank-one corrections for value iteration in Markovian decision problems
From MaRDI portal
Publication:1905071
DOI10.1016/0167-6377(95)00007-7zbMath0843.90126OpenAlexW2169959635WikidataQ126667903 ScholiaQ126667903MaRDI QIDQ1905071
Publication date: 16 January 1996
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(95)00007-7
extrapolation methodGauss-Seidel methodJacobi methodvalue iterationstochastic shortest pathsubdominant eigenvalueMarkovian decision problem
Related Items (2)
Generic rank-one corrections for value iteration in Markovian decision problems ⋮ Accelerated modified policy iteration algorithms for Markov decision processes
Cites Work
- Unnamed Item
- Unnamed Item
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Optimal control of diffusion processes with reflection
- Generic rank-one corrections for value iteration in Markovian decision problems
- A modified dynamic programming method for Markovian decision problems
- Computing the discounted return in markov and semi-markov chains
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Adaptive aggregation methods for infinite horizon dynamic programming
- Improved iterative computation of the expected discounted return in Markov and semi-Markov chains
- Bounds and Transformations for Discounted Finite Markov Decision Chains
- Technical Note—Accelerated Computation of the Expected Discounted Return in a Markov Chain
- Modified Policy Iteration Algorithms for Discounted Markov Decision Problems
- Technical Note—On the Asymptotic Convergence Rate of Cost Differences for Markovian Decision Processes
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: Generic rank-one corrections for value iteration in Markovian decision problems
