2006
DOI: 10.1016/j.simpat.2005.04.001
|View full text |Cite
|
Sign up to set email alerts
|

Refined descriptive sampling: A better approach to Monte Carlo simulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…American options are usually solved by numerical analysis methods, including binary tree method, finite difference method and Monte Carlo simulation method (Caflisch & Chaudhary, 2004). Tari & Dahmani used to take Monte Carlo simulation to reduce the sampling bias and eliminates the problem of descriptive sampling related to the sample size (Tari & Dahmani, 2006). For options that rely on the historical price of the underlying asset to be priced, Monte Carlo simulation is the most suitable (WU & Xuan, 2006).…”
Section: Improving Of the Monte Carlo Simulationmentioning
confidence: 99%
“…American options are usually solved by numerical analysis methods, including binary tree method, finite difference method and Monte Carlo simulation method (Caflisch & Chaudhary, 2004). Tari & Dahmani used to take Monte Carlo simulation to reduce the sampling bias and eliminates the problem of descriptive sampling related to the sample size (Tari & Dahmani, 2006). For options that rely on the historical price of the underlying asset to be priced, Monte Carlo simulation is the most suitable (WU & Xuan, 2006).…”
Section: Improving Of the Monte Carlo Simulationmentioning
confidence: 99%
“…However, this slow convergence rate requires a large sample size, which hinders the application of Monte Carlo simulation when J(ξ) is relatively expensive to compute. While the convergence rate of Monte Carlo methods can be improved with different sampling techniques [20][21][22][23], these sampling strategies are still not sufficient on their own to make Monte Carlo tractable for computationally demanding analyses. In addition, propagation using Monte Carlo methods also results in noisy objective and constraint functions, which presents challenges for gradient-based optimization [24].…”
Section: A Monte Carlo Simulationmentioning
confidence: 99%
“…Nonlinear Programing with Non-Monotone and Distributed Line Search (NLPQLP) optimization method (Schittkowski, 2006), a well suited method for highly non-linear design spaces, was used for the optimization purpose. A descriptive sampling technique (Tari and Dahmani, 2006) was used for MCS, which is more efficient than the conventional simple random sampling method (Koch et al, 2004). 50 samples were considered for the MCS during each optimization iteration.…”
Section: Optimization Proceduresmentioning
confidence: 99%