论文信息 - Approximative solutions of stochastic optimization problems

Approximative solutions of stochastic optimization problems

The aim of this paper is to present some ideas how to relax the notion of the optimal solution of the stochastic optimization problem. In the deterministic case, e-minimal solutions and level-minimal solutions are considered as desired relaxations. We call them approximative solutions and we introduce some possibilities how to combine them with randomness. Relations among random versions of approximative solutions and their consistency are presented in this paper. No measurability is assumed, therefore, treatment convenient for nonmeasurable objects is employed.

Petr Lachout

[1] Petr Lachout. Stability of stochastic optimization problems - nonmeasurable case , 2008, Kybernetika.

[2] P. Lachout,et al. STRONG CONVERGENCE OF ESTIMATORS AS cn-MINIMISERS OF OPTIMISATION PROBLEMS* , 2005 .

[3] Petr Lachout,et al. On continuous convergence and epi-convergence of random functions. Part I: Theory and relations , 2003, Kybernetika.

[4] Jon A. Wellner,et al. Weak Convergence and Empirical Processes: With Applications to Statistics , 1996 .

[5] Stephen M. Robinson,et al. Analysis of Sample-Path Optimization , 1996, Math. Oper. Res..

[6] I. Vajda,et al. On asymptotically optimal estimates for general observations , 1997 .

[7] Petr Lachout,et al. On continuous convergence and epi-convergence of random functions. Part II: Sufficient conditions and applications , 2003, Kybernetika.

[8] Petr Lachout,et al. Strong convergence of estimators as εn-minimisers of optimisation problemsof optimisation problems , 2005 .