Epi‐consistency of convex stochastic programs

DOI10.1080/17442509108833676zbMath0733.90049OpenAlexW2087233288WikidataQ105583966 ScholiaQ105583966MaRDI QIDQ3360665

Publication date: 1991

Published in: Stochastics and Stochastic Reports (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17442509108833676

zbMATH Keywords

strong law of large numbers random sets empirical measures statistical consistency convex stochastic optimization epi-consistency epigraphs of the conjugate functions

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic programming (90C15)

Related Items

A functional version of the Birkhoff ergodic theorem for a normal integrand: A variational approach, Learning models with uniform performance via distributionally robust optimization, Multivalued strong laws of large numbers in the slice topology. Application to integrands, A multivalued strong law of large numbers, A stochastic approach to stability in stochastic programming, A rank-corrected procedure for matrix completion with fixed basis coefficients, Statistical approximations for recourse constrained stochastic programs, Consistency of statistical estimators of solutions to stochastic optimization problems, Sequential characterization of statistical epi-convergence, Challenges in stochastic programming, Stochastic Nash equilibrium problems: sample average approximation and applications, A primal-dual approach to inexact subgradient methods, Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints, Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso, Efficient Stochastic Programming in Julia, Scenario generation for stochastic optimization problems via the sparse grid method, Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation, An SQP-type method and its application in stochastic programs, Simulation-based confidence bounds for two-stage stochastic programs, The existence of maximum likelihood estimate in high-dimensional binary response generalized linear models, An approximation scheme for uncertain minimax optimal control problems, Unnamed Item, Unnamed Item, Stochastic multiobjective optimization: Sample average approximation and applications, Efficient sample sizes in stochastic nonlinear programming, Stability analysis for stochastic programs, Unnamed Item, A non-exponential extension of Sanov’s theorem via convex duality, Simulation-Based Optimality Tests for Stochastic Programs, Maximum a posteriori estimators as a limit of Bayes estimators, A stochastic programming model for service scheduling with uncertain demand: an application in open-access clinic scheduling, On stability in multiobjective programming. A stochastic approach, Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming, Nonparametric maximum-likelihood estimation of probability measures: existence and consist\-en\-cy, Stability and sensitivity-analysis for stochastic programming, Robust sample average approximation, Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach, Epiconvergence of relaxed stochastic optimization problems, Enhancements of two-stage stochastic decomposition, Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications, Convergence analysis of some methods for minimizing a nonsmooth convex function, Parallel processors for planning under uncertainty, Convergence of the empirical mean method in statistics and stochastic programming, Epi-convergence of sequences of normal integrands and strong consistency of the maximum likelihood estimator, Unnamed Item, Unnamed Item, Epi-consistency in restricted regression models. The case of general convex fitting function, Stochastic programming approaches to stochastic scheduling, Monte Carlo bounding techniques for determinig solution quality in stochastic programs, Estimating density functions: a constrained maximum likelihood approach^*, On sample average approximation for two-stage stochastic programs without relatively complete recourse, Inexact subgradient methods with applications in stochastic programming, Bias Reduction in Sample-Based Optimization, Technical Note—Two-Stage Sample Robust Optimization

Cites Work