Approximative solutions of stochastic optimization problems
Kybernetika, Tome 46 (2010) no. 3, pp. 513-523 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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, $\varepsilon$-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.
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, $\varepsilon$-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.
Classification : 60F99, 62F12, 90C15, 90C31
Keywords: the optimal solution; $\varepsilon $-minimal solutions; level-minimal solutions; randomness
@article{KYB_2010_46_3_a14,
     author = {Lachout, Petr},
     title = {Approximative solutions of stochastic optimization problems},
     journal = {Kybernetika},
     pages = {513--523},
     year = {2010},
     volume = {46},
     number = {3},
     mrnumber = {2676087},
     zbl = {1229.90110},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_2010_46_3_a14/}
}
TY  - JOUR
AU  - Lachout, Petr
TI  - Approximative solutions of stochastic optimization problems
JO  - Kybernetika
PY  - 2010
SP  - 513
EP  - 523
VL  - 46
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/KYB_2010_46_3_a14/
LA  - en
ID  - KYB_2010_46_3_a14
ER  - 
%0 Journal Article
%A Lachout, Petr
%T Approximative solutions of stochastic optimization problems
%J Kybernetika
%D 2010
%P 513-523
%V 46
%N 3
%U http://geodesic.mathdoc.fr/item/KYB_2010_46_3_a14/
%G en
%F KYB_2010_46_3_a14
Lachout, Petr. Approximative solutions of stochastic optimization problems. Kybernetika, Tome 46 (2010) no. 3, pp. 513-523. http://geodesic.mathdoc.fr/item/KYB_2010_46_3_a14/

[1] Lachout, P.: Stability of stochastic optimization problem – nonmeasurable case. Kybernetika 44 (2008), 2, 259–276. | MR

[2] Lachout, P.: Stochastic optimization sensitivity without measurability. In: Proc. 15th MMEI held in Herlány, Slovakia (K. Cechlárová, M. Halická, V. Borbelóvá, and V. Lacko, eds.) 2007, pp. 131–136.

[3] Lachout, P., Liebscher, E., Vogel, S.: Strong convergence of estimators as $\varepsilon _n$-minimizers of optimization problems. Ann. Inst. Statist. Math. 57 (2005), 2, 291–313. | DOI | MR

[4] Lachout, P., Vogel, S.: On continuous convergence and epi-convergence of random functions. Part I: Theory and relations. Kybernetika 39 (2003), 1, 75–98. | MR

[5] Robinson, S. M.: Analysis of sample-path optimization. Math. Oper. Res. 21 (1996), 3, 513–528. | DOI | MR | Zbl

[6] Rockafellar, T., Wets, R. J.-B.: Variational Analysis. Springer-Verlag, Berlin 1998. | MR | Zbl

[7] Vajda, I., Janžura, M.: On asymptotically optimal estimates for general observations. Stoch. Process. Appl. 72 (1997), 1, 27–45. | DOI | MR

[8] Vaart, A. W. van der, Wellner, J. A.: Weak Convergence and Empirical Processes. Springer, New York 1996. | MR