The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate
Year of publication: |
2011
|
---|---|
Authors: | Ye, Yinyu |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 36.2011, 4, p. 593-603
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Markov-Kette | Markov chain |
-
Li, Chenglong, (2024)
-
Li, Lode, (1999)
-
On the distribution of read heads acting on a computer hard disk
Lenz, Hans-Joachim, (1998)
- More ...
-
Variance reduced value iteration and faster algorithms for solving Markov decision processes
Wu, Xian, (2021)
-
A Centered Projective Algorithm for Linear Programming
Todd, Michael J., (1988)
-
Sparse Portfolio Selection via Quasi-Norm Regularization
Chen, Caihua, (2013)
- More ...