Adaptive optimization of the Monte-Carlo method (Q1842446): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q260735 |
||
Property / reviewed by | |||
Property / reviewed by: Wilfried Grecksch / rank | |||
Revision as of 10:53, 12 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Adaptive optimization of the Monte-Carlo method |
scientific article |
Statements
Adaptive optimization of the Monte-Carlo method (English)
0 references
17 May 1995
0 references
Let \(\zeta(u)\) be a random nonnegative function where \(u\in U\) is from a closed convex bounded subset in a finite-dimensional Euclidean space. Assume that the mean function \(m(u)= E(\zeta(u))\) is a continuously differentiable convex function. It is constructed a sequence of random vectors \(u^j\) with \(P\{\lim_{k\to \infty} {1\over k} \sum^k_{j= 1} (\zeta(u^j))= m^*\}= 1\), where \(m^*= \min\{m(u): u\in U\}\) and a bound rate of convergence in probability is proved.
0 references
Monte Carlo simulation
0 references
stochastic optimization
0 references
adaptive strategy
0 references