Variance reduction in Monte Carlo methods and optimization problems in \({\mathbb{R}}^ n\) (Q1081271)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3969978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Variance reduction in Monte Carlo methods and optimization problems in \({\mathbb{R}}^ n\) |
scientific article; zbMATH DE number 3969978 |
Statements
Variance reduction in Monte Carlo methods and optimization problems in \({\mathbb{R}}^ n\) (English)
0 references
1983
0 references
In the framework of Monte Carlo methods a technique for reducing the variance is considered. Generalizing a procedure suggested by the second author, Probabilistic estimation of error in Richardson extrapolation. ibid. 20, 455-465 (Italian) (1983), we give a method which reduces the variance by solving an unconstrained optimization problem. Concerned with the approximate integration, some numerical tests are considered. The described technique is shown to allow more accurate results than some known ones.
0 references
variance reduction
0 references
Monte Carlo methods
0 references
unconstrained optimization problem
0 references
0.8369104862213135
0 references
0.8170700073242188
0 references
0.814475417137146
0 references
0.8073459267616272
0 references
0.8057382106781006
0 references
