Convergence conditions for the observed mean method in stochastic programming

DOI10.1007/S10559-018-0006-3zbMath1384.90068OpenAlexW2787494427MaRDI QIDQ1745693

Pavel S. Knopov, Vladimir I. Norkin

Publication date: 18 April 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-018-0006-3

zbMATH Keywords

stochastic programminglarge deviationsmixing conditionsprobability functionsdiscontinuous functionsconvergence of a methoddependent observationsobserved mean method

Mathematics Subject Classification ID

Stochastic programming (90C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
• On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem
• On large deviations of empirical estimates in a stochastic programming problem with time-dependent observations
• An integer programming approach for linear programs with probabilistic constraints
• Uniform laws of large numbers for set-valued mappings and subdifferentials of random functions
• Sample average approximation method for chance constrained programming: Theory and applications
• Relaxations for probabilistically constrained programs with discrete random variables
• On large deviations for uniformly strong mixing sequences
• Empirical estimates in stochastic optimization and identification
• Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
• Large deviations for the method of empirical means in stochastic optimization problems with continuous time observations
• \(\alpha\)-concave functions and measures and their applications
• Probabilistic bounds (via large deviations) for the solutions of stochastic programming problems
• Reducing two-stage probabilistic optimization problems with discrete distribution of random data to mixed-integer programming problems
• A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
• Integrals of set-valued functions
• Large deviations of empirical estimates in stochastic programming problems
• Theory of Classification: a Survey of Some Recent Advances
• Lectures on Stochastic Programming
• Robust Stochastic Approximation Approach to Stochastic Programming
• Introduction to Stochastic Programming
• Linear Programming
• Sample Average Approximation Method for Compound Stochastic Optimization Problems
• Safety-first portfolio selection
• Convergence properties of two-stage stochastic programming

This page was built for publication: Convergence conditions for the observed mean method in stochastic programming