Pages that link to "Item:Q5353422"
From MaRDI portal
The following pages link to An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls (Q5353422):
Displaying 13 items.
- Least squares approximate policy iteration for learning bid prices in choice-based revenue management (Q1652041) (← links)
- Heuristic decision rules for short-term trading of renewable energy with co-located energy storage (Q1652308) (← links)
- On the complexity of energy storage problems (Q1662159) (← links)
- Shape constraints in economics and operations research (Q1730901) (← links)
- A new separable piecewise linear learning algorithm for the stochastic empty container repositioning problem (Q2007112) (← links)
- Sell or store? An ADP approach to marketing renewable energy (Q2011830) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- Data-based robust adaptive control for a class of unknown nonlinear constrained-input systems via integral reinforcement learning (Q2282078) (← links)
- A new convergent hybrid learning algorithm for two-stage stochastic programs (Q2286915) (← links)
- Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States (Q4634100) (← links)
- Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control of Grid-Level Energy Storage (Q5131714) (← links)
- Least squares policy iteration with instrumental variables vs. direct policy search: comparison against optimal benchmarks using energy storage (Q5882386) (← links)
- Infinite time linear quadratic Stackelberg game problem for unknown stochastic discrete-time systems via adaptive dynamic programming approach (Q6569870) (← links)
