A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
From MaRDI portal
Recommendations
- A computationally efficient FPTAS for convex stochastic dynamic programs
- A PTAS for a class of stochastic dynamic programs
- Solving Stochastic Dynamic Programs by Convex Optimization and Simulation
- Stochastic convexity in dynamic programming
- scientific article; zbMATH DE number 7733457
- Fully polynomial time approximation schemes for stochastic dynamic programs
- An approximation scheme for stochastic dynamic optimization problems
- An Asymptotically Efficient Simulation-Based Algorithm for Finite Horizon Stochastic Dynamic Programming
- Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states
Cited in
(6)- Approximating convex functions via non-convex oracles under the relative noise model
- Fixed-dimensional stochastic dynamic programs: an approximation scheme and an inventory application
- A computationally efficient FPTAS for convex stochastic dynamic programs
- Fully polynomial time approximation schemes for stochastic dynamic programs
- Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
This page was built for publication: A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891186)