On the Convergence of Policy Iteration in Stationary Dynamic Programming
DOI10.1287/moor.4.1.60zbMath0411.90072OpenAlexW2042680115MaRDI QIDQ4198357
Shelby Brumelle, Martin L. Puterman
Publication date: 1979
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.4.1.60
rate of convergenceerror boundscompact action spaceprogramming in abstract spacespolicy iteration methodpartially ordered normed linear spacesfinite state Markovian decision problemNewton-Kantorovich iteration procedurestationary dynamic programming
Minimax problems in mathematical programming (90C47) Newton-type methods (49M15) Normed linear spaces and Banach spaces; Banach lattices (46B99) Dynamic programming (90C39) Programming in abstract spaces (90C48) Markov and semi-Markov decision processes (90C40) Rate of convergence, degree of approximation (41A25)
Related Items (42)
This page was built for publication: On the Convergence of Policy Iteration in Stationary Dynamic Programming