Total variation bounds on the expectation of periodic functions with applications to recourse approximations
From MaRDI portal
Publication:291034
DOI10.1007/s10107-014-0829-2zbMath1353.90099OpenAlexW1992181083MaRDI QIDQ291034
Maarten H. van der Vlerk, Ward Romeijnders, Willem K. Klein Haneveld
Publication date: 6 June 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://pure.rug.nl/ws/files/63158383/Total_variation_bounds_on_the_expectation.pdf
total variationstochastic programmingconvex approximationsdiscrete approximationsperiodic functionsinteger recourse
Related Items
An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information ⋮ Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk ⋮ A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models ⋮ The stochastic programming heritage of Maarten van der Vlerk ⋮ Higher-order total variation bounds for expectations of periodic functions and simple integer recourse approximations ⋮ Distributionally robust simple integer recourse ⋮ A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound ⋮ Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty ⋮ Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An upper bound for SLP using first and total second moments
- Stochastic integer programming: general models and algorithms
- Stochastic programming with simple integer recourse
- Scenario reduction in stochastic programming
- Convex approximations for complete integer recourse models
- Scenario reduction algorithms in stochastic programming
- Simple integer recourse models: convexity and convex approximations
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- Stochastic Programming
- Convex Approximations for Totally Unimodular Integer Recourse Models: A Uniform Error Bound
- Continuity Properties of Expectation Functions in Stochastic Integer Programming
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- Lectures on Stochastic Programming
- Aggregation bounds in stochastic linear programming
- A tight upper bound for the expectation of a convex function of a multivariate random variable
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- Introduction to Stochastic Programming
- Applications of Stochastic Programming
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Scenarios for multistage stochastic programs
- Scenario tree generation for multiperiod financial optimization of optimal discretization
