Backward resampling in stochastic dual dynamic programming: application to power generation planning
From MaRDI portal
Cites work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming
- A sequential sampling procedure for stochastic programming
- A simulation-based approach to two-stage stochastic programming with recourse
- A vector quantization approach to scenario generation for stochastic NMPC
- Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
- Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse
- Algorithm AS 136: A K-Means Clustering Algorithm
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
- An empirical analysis of scenario generation methods for stochastic optimization
- An improved averaged two-replication procedure with Latin hypercube sampling
- Analysis of stochastic dual dynamic programming method
- Approximations to Stochastic Programs with Complete Recourse
- Assessing policy quality in a multistage stochastic program for long-term hydrothermal scheduling
- Assessing solution quality in stochastic programs
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse
- Cut sharing for multistage stochastic linear programs with interstage dependency
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Dual dynamic programming with cut selection: convergence proof and numerical experiments
- Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
- Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion
- Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse
- Generalized adaptive partition-based method for two-stage stochastic linear programs: geometric oracle and analysis
- scientific article; zbMATH DE number 4062822 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 854710 (Why is no real title available?)
- scientific article; zbMATH DE number 6296781 (Why is no real title available?)
- scientific article; zbMATH DE number 7733446 (Why is no real title available?)
- Implementing bounds-based approximations in convex-concave two-stage stochastic programming
- Improving the performance of stochastic dual dynamic programming
- Inference of statistical bounds for multistage stochastic programming problems
- Jensen's inequality for a convex vector-valued function on an infinite-dimensional space
- Modeling time-dependent randomness in stochastic dual dynamic programming
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Multi-stage stochastic linear programs for portfolio optimization
- Multi-stage stochastic optimization applied to energy planning
- Multistage Stochastic Decomposition: A Bridge between Stochastic Programming and Approximate Dynamic Programming
- Multistage Stochastic Programming with Recourse: The Equivalent Deterministic Problem
- On conditional cuts for stochastic dual dynamic programming
- On Rates of Convergence for Stochastic Optimization Problems Under Non–Independent and Identically Distributed Sampling
- On solving multistage stochastic programs with coherent risk measures
- On the convergence of stochastic dual dynamic programming and related methods
- On the solution variability reduction of stochastic dual dynamic programming applied to energy planning
- Parallel and distributed computing for stochastic dual dynamic programming
- Quantization
- Refining bounds for stochastic linear programs with linearly transformed independent random variables
- Risk neutral and risk averse stochastic dual dynamic programming method
- Risk neutral reformulation approach to risk averse stochastic programming
- Sequential importance sampling algorithms for dynamic stochastic programming
- Simulation-based confidence bounds for two-stage stochastic programs
- Simulation-Based Optimality Tests for Stochastic Programs
- Stability in Two-Stage Stochastic Programming
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- Stochastic dual dynamic integer programming
- Stochastic dual dynamic programming and its variants: a review
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models
- Stochastic scenario decomposition for multistage stochastic programs
- The abridged nested decomposition method for multistage stochastic linear programs with relatively complete recourse
- The sample average approximation method for stochastic discrete optimization
- The Scenario Generation Algorithm for Multistage Stochastic Linear Programming
- Variable-sample methods for stochastic optimization
- Worst-case-expectation approach to optimization under uncertainty
This page was built for publication: Backward resampling in stochastic dual dynamic programming: application to power generation planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325208)