Scenario generation for stochastic optimization problems via the sparse grid method
type: Item
instance of: scholarly article
title: Scenario generation for stochastic optimization problems via the sparse grid method
zbMATH Open document ID: 1331.90043
author: N. E. Zubov
published in: Computational Optimization and Applications
publication date: 2016-01-07T00:00:00Z
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 6527106
zbMATH Keywords: scenario generation
zbMATH Keywords: stochastic optimization
zbMATH Keywords: discretization
zbMATH Keywords: sparse grid
describes a project that uses: HRMSYM
describes a project that uses: nwSpGr
describes a project that uses: PATSYM
describes a project that uses: Lattice Builder
MaRDI profile type: Publication
Wikidata QID: Q57435304
full work available at URL: s10589-015-9751-7
OpenAlex ID: W1982566213
cites work: Sparse grids
cites work: The Scenario Generation Algorithm for Multistage Stochastic Linear Programming
cites work: Scenarios for multistage stochastic programs
cites work: Q4060253
cites work: EVPI-based importance sampling solution procedures for multistage stochastic linear programmes on parallel MIMD architectures
cites work: Q3160669
cites work: Q3415352
cites work: Scenario reduction in stochastic programming
cites work: Q4399897
cites work: Q4255465
cites work: Fully symmetric interpolatory rules for multiple integrals over infinite regions with Gaussian weight
cites work: Numerical integration using sparse grids
cites work: Likelihood approximation by numerical integration on sparse grids
cites work: Scenario tree modeling for multistage stochastic programs
cites work: The curse of dimensionality for numerical integration of smooth functions
cites work: Q5444109
cites work: Epi‐consistency of convex stochastic programs
cites work: Q5502876
cites work: Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
cites work: On Figures of Merit for Randomly-Shifted Lattice Rules
cites work: Generating moment matching scenarios using optimization techniques
cites work: Stieltjes Polynomials and Related Quadrature Rules
cites work: Introduction to Numerical Analysis
cites work: Q4003879
cites work: Monte Carlo and Quasi-Monte Carlo Methods 2004
cites work: A branch and bound method for stochastic global optimization
cites work: High dimensional integration of smooth functions over cubes
cites work: Simple cubature formulas with high polynomial exactness
cites work: The Optimum Addition of Points to Quadrature Formulae
cites work: An algorithm for generating interpolatory quadrature rules of the highest degree of precision with preassigned nodes for general weight functions
cites work: Epi-Convergent Discretizations of Multistage Stochastic Programs
cites work: Epi-convergent discretizations of stochastic programs via integration quadratures
cites work: Scenario tree generation for multiperiod financial optimization of optimal discretization
cites work: Q4340161
cites work: Q4875312
cites work: Applications of Stochastic Programming
cites work: Explicit cost bounds of algorithms for multivariate tensor product problems
DOI: 10.1007/S10589-015-9751-7
description: scientific article; zbMATH DE number 6527106