Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time (Q5119845)
From MaRDI portal
scientific article; zbMATH DE number 7242693
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time |
scientific article; zbMATH DE number 7242693 |
Statements
Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time (English)
0 references
1 September 2020
0 references
Markov decision process
0 references
randomized algorithm
0 references
linear programming
0 references
duality
0 references
primal-dual method
0 references
runtime complexity
0 references
stochastic approximation
0 references
0 references
0 references
0 references
