Multistage Stochastic Decomposition: A Bridge between Stochastic Programming and Approximate Dynamic Programming
From MaRDI portal
Publication:4979862
Recommendations
- Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems
- Stochastic scenario decomposition for multistage stochastic programs
- Bounds and approximations for multistage stochastic programs
- The policy graph decomposition of multistage stochastic programming problems
- Multistage stochastic programs via stochastic parametric optimization
- Multistage stochastic programming problems; stability and approximation
- On the convergence of sampling-based decomposition algorithms for multistage stochastic programs
- scientific article; zbMATH DE number 958363
- On complexity of multistage stochastic programs
Cited in
(30)- Stochastic scenario decomposition for multistage stochastic programs
- Evaluating policies in risk-averse multi-stage stochastic programming
- Shape constraints in economics and operations research
- Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming
- Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization
- SDDP for multistage stochastic linear programs based on spectral risk measures
- Stochastic Dynamic Linear Programming: A Sequential Sampling Algorithm for Multistage Stochastic Linear Programming
- A scalable bounding method for multistage stochastic programs
- Stochastic Decomposition for Two-Stage Stochastic Linear Programs with Random Cost Coefficients
- Conditional Stochastic Decomposition: An Algorithmic Interface for Optimization and Simulation
- Towards a sustainable power grid: stochastic hierarchical planning for high renewable integration
- scientific article; zbMATH DE number 7733435 (Why is no real title available?)
- A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
- Sharing cuts under aggregated forecasts when decomposing multi-stage stochastic programs
- Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers
- Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
- Dynamic stochastic approximation for multi-stage stochastic optimization
- A unified framework for stochastic optimization
- MIDAS: a mixed integer dynamic approximation scheme
- Asymptotic results of stochastic decomposition for two-stage stochastic quadratic programming
- Predictive stochastic programming
- Integrated multiresource capacity planning and multitype patient scheduling
- Distribution-free algorithms for predictive stochastic programming in the presence of streaming data
- Regularized decomposition of high-dimensional multistage stochastic programs with Markov uncertainty
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- An effective heuristic for multistage linear programming with a stochastic right-hand side
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
- Regularized stochastic dual dynamic programming for convex nonlinear optimization problems
- Two-stage linear decision rules for multi-stage stochastic programming
This page was built for publication: Multistage Stochastic Decomposition: A Bridge between Stochastic Programming and Approximate Dynamic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979862)
