Low-discrepancy sampling for approximate dynamic programming with local approximators
From MaRDI portal
Publication:336896
DOI10.1016/j.cor.2013.09.006zbMath1348.90616OpenAlexW2097394825WikidataQ59403922 ScholiaQ59403922MaRDI QIDQ336896
Cristiano Cervellera, Mauro Gaggero, Danilo Macciò
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.006
approximate dynamic programminglocal approximationinventory forecastinglow-discrepancy samplingNadaraya-Watson models
Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Related Items
Efficient approximate dynamic programming based on design and analysis of computer experiments for infinite-horizon optimization ⋮ Approximate stochastic dynamic programming for hydroelectric production planning ⋮ Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point sets and sequences with small discrepancy
- A comparison of global and semi-local approximation in \(T\)-stage stochastic optimization
- Neural network and regression spline value function approximations for stochastic dynamic programming
- Kernel-based reinforcement learning
- Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- Efficient sampling in approximate dynamic programming algorithms
- Kernel smoothers: an overview of curve estimators for the first graduate course in nonparametric statistics
- Applying Experimental Design and Regression Splines to High-Dimensional Continuous-State Stochastic Dynamic Programming
- Measuring the Goodness of Orthogonal Array Discretizations for Stochastic Programming and Stochastic Dynamic Programming
- Approximate Dynamic Programming
- Numerical Solution of Continuous-State Dynamic Programs Using Linear and Spline Interpolation
- Real Analysis and Probability
- Polynomial Approximation--A New Computational Technique in Dynamic Programming: Allocation Processes
- An Estimate Concerning the Kolmogroff Limit Distribution
