An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls
From MaRDI portal
Cited in
(13)- Least squares approximate policy iteration for learning bid prices in choice-based revenue management
- Heuristic decision rules for short-term trading of renewable energy with co-located energy storage
- On the complexity of energy storage problems
- Shape constraints in economics and operations research
- A new separable piecewise linear learning algorithm for the stochastic empty container repositioning problem
- Sell or store? An ADP approach to marketing renewable energy
- Fully polynomial time (,)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
- Data-based robust adaptive control for a class of unknown nonlinear constrained-input systems via integral reinforcement learning
- A new convergent hybrid learning algorithm for two-stage stochastic programs
- Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states
- Benchmarking a scalable approximate dynamic programming algorithm for stochastic control of grid-level energy storage
- Least squares policy iteration with instrumental variables vs. direct policy search: comparison against optimal benchmarks using energy storage
- Infinite time linear quadratic Stackelberg game problem for unknown stochastic discrete-time systems via adaptive dynamic programming approach
This page was built for publication: An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353422)