Generalized polynomial approximations in Markovian decision processes
type: Item
instance of: scholarly article
title: Generalized polynomial approximations in Markovian decision processes
zbMATH Open document ID: 0578.90091
DOI: 10.1016/0022-247X(85)90317-8
author: Paul J. Schweitzer
author: Abraham Seidmann
published in: Journal of Mathematical Analysis and Applications
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3926667
zbMATH Keywords: value function
zbMATH Keywords: Markovian decision process
zbMATH Keywords: linear superposition
zbMATH Keywords: policy iteration
zbMATH Keywords: least squares
MaRDI profile type: Publication
cites work: Polynomial Approximation--A New Computational Technique in Dynamic Programming: Allocation Processes
cites work: Q5543516
cites work: Splines and efficiency in dynamic programming
cites work: Multichain Markov Renewal Programs
cites work: Finite state Markovian decision processes
cites work: Q3206684
cites work: Technical Note—Bounds on the Gain of a Markov Decision Process
cites work: Linear Programming and Markov Decision Chains
cites work: Q5335719
cites work: Markov-Renewal Programming. I: Formulation, Finite Return Models
cites work: A modified dynamic programming method for Markovian decision problems
cites work: Linear programming algorithms for semi-Markovian decision processes
cites work: Bounds and Transformations for Discounted Finite Markov Decision Chains
cites work: Multiple Policy Improvements in Undiscounted Markov Renewal Programming
cites work: Iterative solution of the functional equations of undiscounted Markov renewal programming
cites work: The Functional Equations of Undiscounted Markov Renewal Programming
cites work: Dynamic programming, Markov chains, and the method of successive approximations
description: scientific article; zbMATH DE number 3926667