2002
DOI: 10.1007/s007800200071
|View full text |Cite
|
Sign up to set email alerts
|

An analysis of a least squares regression method for American option pricing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

7
219
0

Year Published

2007
2007
2016
2016

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 288 publications
(226 citation statements)
references
References 9 publications
7
219
0
Order By: Relevance
“…A rigorous mathematical justification and proof of the almost sure convergence of the method can be found in Clement et al (2002).…”
Section: The Least Squares Methodsmentioning
confidence: 99%
“…A rigorous mathematical justification and proof of the almost sure convergence of the method can be found in Clement et al (2002).…”
Section: The Least Squares Methodsmentioning
confidence: 99%
“…Clément, Lamberton and Protter (2002) were first who proved the convergence of the Longstaff-Schwartz algorithm. Glasserman and Yu (2005) have shown that the number of Monte Carlo paths has to be exponential in the number of basis functions used for regression in order to ensure convergence.…”
Section: Convergence Analysis Of Regression Methodsmentioning
confidence: 99%
“…Convergence proofs for global estimators are more delicate and usually impose rather strong assumptions on C r and the underlying Markov process X r . For the standard Bermudan stopping problem (f r ≡ 0, ϕ ≡ 1) we refer to Clément, Lamberton and Protter (2002), Egloff (2005) and Egloff, Kohler and Todorovic (2007). The global regression procedures in the next two sections are in some sense a generalization of the methods of Tsitsiklis and Van Roy (1999) and Longstaff and Schwartz (2001), respectively, to optimal control problems.…”
Section: Global Regression Estimatorsmentioning
confidence: 99%
“…To summarize the current state-ofthe-art in this field, let us mention the work of Clément et al (2002) and Egloff (2005) on the Longstaff-Schwartz scheme and Bouchard and Touzi (2004), Bally and Pagès (2003) and Gobet et al (2005) on numerical methods for backward SDEs. For the LS scheme it has been shown that the use of optimal-stopping-time iteration in (29) is consistent, namely that for a fixed N B the asymptotic sampling error as N → ∞ has mean zero and Gaussian distribution (Clément et al 2002). This result was recently improved by Egloff (2005) who showed that the L 2 -sampling error for a single optimal stopping problem and fixed ∆t is O(log N · N −1 ).…”
Section: Projection Errormentioning
confidence: 99%