Dynamic programming, Markov chains, and the method of successive approximations
From MaRDI portal
Publication:2393803
DOI10.1016/0022-247X(63)90017-9zbMath0124.36404OpenAlexW2081374871MaRDI QIDQ2393803
Publication date: 1963
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(63)90017-9
Related Items (44)
Computation techniques for large scale undiscounted markov decision processes ⋮ Numerical methods for controlled and uncontrolled multiplexing and queueing systems ⋮ Dual bounds on the equilibrium distribution of a finite Markov chain ⋮ A methodology for computation reduction for specially structured large scale Markov decision problems ⋮ How fast do equilibrium payoff sets converge in repeated games? ⋮ On the Control of a Queueing System with Aging State Information ⋮ Contraction mappings underlying undiscounted Markov decision problems. II ⋮ Approximation of average cost optimal policies for general Markov decision processes with unbounded costs ⋮ Value iteration in average cost Markov control processes on Borel spaces ⋮ Relative Value Iteration for Stochastic Differential Games ⋮ Unnamed Item ⋮ Some basic concepts of numerical treatment of Markov decision models ⋮ On the solvability of Bellman's functional equations for Markov renewal programming ⋮ Quality assurance and stage dynamics in multi-stage manufacturing. Part II ⋮ Connectedness conditions used in finite state Markov decision processes ⋮ A note on the convergence rate of the value iteration scheme in controlled Markov chains ⋮ Nonstationary Markov decision problems with converging parameters ⋮ The blast furnaces problem ⋮ On the global convergence of relative value iteration for infinite-horizon risk-sensitive control of diffusions ⋮ \(R(\lambda)\) imitation learning for automatic generation control of interconnected power grids ⋮ The method of value oriented successive approximations for the average reward Markov decision process ⋮ An iterative method for approximating average cost optimal (s,S) inventory policies ⋮ Open Problem—Convergence and Asymptotic Optimality of the Relative Value Iteration in Ergodic Control ⋮ A value iteration method for undiscounted multichain Markov decision processes ⋮ Water reservoir control under economic, social and environmental constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A structured pattern matrix algorithm for multichain Markov decision processes ⋮ Markov decision processes ⋮ Iterative algorithms for solving undiscounted bellman equations ⋮ Spectral inequalities for nonnegative tensors and their tropical analogues ⋮ Exponential convergence of products of stochastic matrices ⋮ Contraction mappings underlying undiscounted Markov decision problems ⋮ Improved iterative computation of the expected discounted return in Markov and semi-Markov chains ⋮ Receding horizon control for water resources management ⋮ Optimal stochastic control ⋮ Iterative solution of the functional equations of undiscounted Markov renewal programming ⋮ On the Optimality of Trunk Reservation in Overflow Processes ⋮ Unnamed Item ⋮ MARKOV DECISION PROCESSES ⋮ Value iteration in countable state average cost Markov decision processes with unbounded costs ⋮ Finite state approximation algorithms for average cost denumerable state Markov decision processes ⋮ Generalized polynomial approximations in Markovian decision processes ⋮ Optimal pricing for a \(\mathrm{GI}/\mathrm{M}/k/N\) queue with several customer types and holding costs
Cites Work
This page was built for publication: Dynamic programming, Markov chains, and the method of successive approximations
