Probabilistic bounds (via large deviations) for the solutions of stochastic programming problems
From MaRDI portal
Publication:1896453
DOI10.1007/BF02031707zbMath0835.90055MaRDI QIDQ1896453
Roger J.-B. Wets, Alan J. King, Yuri M. Kaniovski
Publication date: 15 April 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (21)
A remark on multiobjective stochastic optimization via strongly convex functions ⋮ Challenges in stochastic programming ⋮ Stochastic Nash equilibrium problems: sample average approximation and applications ⋮ Graphical Convergence of Subgradients in Nonconvex Optimization and Learning ⋮ Unnamed Item ⋮ A parallel inexact Newton method for stochastic programs with recourse ⋮ Thin and heavy tails in stochastic programming ⋮ Consistency of Monte Carlo estimators for risk-neutral PDE-constrained optimization ⋮ Moderate Deviations and Invariance Principles for Sample Average Approximations ⋮ Unnamed Item ⋮ A non-exponential extension of Sanov’s theorem via convex duality ⋮ Method of empirical means in stochastic programming problems ⋮ On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling ⋮ Convergence conditions for the observed mean method in stochastic programming ⋮ Convergence properties of two-stage stochastic programming ⋮ Some large deviations results for Latin hypercube sampling ⋮ Large deviations of empirical estimates in the stochastic programming problem for the homogeneous random field with a discrete parameter ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Asymptotic behavior of solutions: an application to stochastic NLP ⋮ On rates of convergence for sample average approximations in the almost sure sense and in mean
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of statistical estimators and of optimal solutions of stochastic optimization problems
- Asymptotic analysis of stochastic programs
- The topology of the \(\rho\)-Hausdorff distance
- Stochastic Optimization Problems with Incomplete Information on Distribution Functions
- Stochastic programming with incomplete information:a surrey of results on postoptimization and sensitivity analysis
- Stability in Two-Stage Stochastic Programming
- Stability results for stochastic programming problems
- Quantitative Stability of Variational Systems: I. The Epigraphical Distance
- Constrained estimation: Consistency and asymptotics
- Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming
- Conjugate Convex Functions and the Epi-Distance Topology
- Quantitative Stability of Variational Systems II. A Framework for Nonlinear Conditioning
- Probability Inequalities for Sums of Bounded Random Variables
- Robust Estimation of a Location Parameter
- Note on the Consistency of the Maximum Likelihood Estimate
This page was built for publication: Probabilistic bounds (via large deviations) for the solutions of stochastic programming problems