Efficient sampling in approximate dynamic programming algorithms
From MaRDI portal
(Redirected from Publication:2477014)
Recommendations
- Low-discrepancy sampling for approximate dynamic programming with local approximators
- Perspectives of approximate dynamic programming
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- The Linear Programming Approach to Approximate Dynamic Programming
- Lattice point sets for state sampling in approximate dynamic programming
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 42272 (Why is no real title available?)
- scientific article; zbMATH DE number 52448 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 735224 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- scientific article; zbMATH DE number 3325181 (Why is no real title available?)
- scientific article; zbMATH DE number 3354103 (Why is no real title available?)
- An optimal one-way multigrid algorithm for discrete-time stochastic control
- Applying experimental design and regression splines to high-dimensional continuous-state stochastic dynamic programming
- Approximating networks and extended Ritz method for the solution of functional optimization problems
- Convergence of discretization procedures in dynamic programming
- Hinging hyperplanes for regression, classification, and function approximation
- Neural network and regression spline value function approximations for stochastic dynamic programming
- Numerical Solution of Continuous-State Dynamic Programs Using Linear and Spline Interpolation
- Optimization of a large-scale water reservoir network by stochastic dynamic programming with efficient state space discretization
- Polynomial Approximation--A New Computational Technique in Dynamic Programming: Allocation Processes
- Programs to generate Niederreiter's low-discrepancy sequences
- Universal approximation bounds for superpositions of a sigmoidal function
Cited in
(17)- An efficient DP algorithm on a tree-structure for finite horizon optimal control problems
- Optimization based on quasi-Monte Carlo sampling to design state estimators for non-linear systems
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- Optimal sampling from sliding windows
- Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
- Suboptimal Policies for Stochastic $$N$$-Stage Optimization: Accuracy Analysis and a Case Study from Optimal Consumption
- A comparison of global and semi-local approximation in \(T\)-stage stochastic optimization
- A Constant Factor Approximation Algorithm for Event-Based Sampling
- Efficient approximate dynamic programming based on design and analysis of computer experiments for infinite-horizon optimization
- Low-discrepancy sampling for approximate dynamic programming with local approximators
- Management of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic sampling
- scientific article; zbMATH DE number 3863956 (Why is no real title available?)
- Functional optimal estimation problems and their solution by nonlinear approximation schemes
- A kernel-based approximate dynamic programming approach: theory and application
- Hybrid simplicial-randomized approximate stochastic dynamic programming for multireservoir optimization
- Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results
- Lattice point sets for state sampling in approximate dynamic programming
This page was built for publication: Efficient sampling in approximate dynamic programming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477014)