Efficient approximate dynamic programming based on design and analysis of computer experiments for infinite-horizon optimization
From MaRDI portal
Publication:2664400
DOI10.1016/j.cor.2020.105032zbMath1458.90629OpenAlexW3038045554MaRDI QIDQ2664400
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105032
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Low-discrepancy sampling for approximate dynamic programming with local approximators
- Adaptive value function approximation for continuous-state stochastic dynamic programming
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Optimization of a large-scale water reservoir network by stochastic dynamic programming with efficient state space discretization
- Neural network and regression spline value function approximations for stochastic dynamic programming
- Multivariate adaptive regression splines
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- A convex version of multivariate adaptive regression splines
- Approximate stochastic dynamic programming for hydroelectric production planning
- Controlled approximation of the value function in stochastic dynamic programming for multi-reservoir systems
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- Efficient sampling in approximate dynamic programming algorithms
- Applying Experimental Design and Regression Splines to High-Dimensional Continuous-State Stochastic Dynamic Programming
- Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network
- Approximate Dynamic Programming
- Introduction to Stochastic Programming
This page was built for publication: Efficient approximate dynamic programming based on design and analysis of computer experiments for infinite-horizon optimization
