IDEAS home Printed from
   My bibliography  Save this article

Convergence of a Least-Squares Monte Carlo Algorithm for Bounded Approximating Sets


  • Daniel Zanger


We analyse the convergence properties of the Longstaff-Schwartz algorithm for approximately solving optimal stopping problems that arise in the pricing of American (Bermudan) financial options. Based on a new approximate dynamic programming principle error propagation inequality, we prove sample complexity error estimates for this algorithm for the case in which the corresponding approximation spaces may not necessarily possess any linear structure at all and may actually be any arbitrary sets of functions, each of which is uniformly bounded and possesses finite VC-dimension, but is not required to satisfy any further material conditions. In particular, we do not require that the approximation spaces be convex or closed, and we thus significantly generalize the results of Egloff, Clement et al., and others. Using our error estimation theorems, we also prove convergence, up to any desired probability, of the algorithm for approximating sets defined using L2 orthonormal bases, within a framework depending subexponentially on the number of time steps. In addition, we prove estimates on the overall convergence rate of the algorithm for approximation spaces defined by polynomials.

Suggested Citation

  • Daniel Zanger, 2009. "Convergence of a Least-Squares Monte Carlo Algorithm for Bounded Approximating Sets," Applied Mathematical Finance, Taylor & Francis Journals, vol. 16(2), pages 123-150.
  • Handle: RePEc:taf:apmtfi:v:16:y:2009:i:2:p:123-150
    DOI: 10.1080/13504860802516881

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Maciej Klimek & Marcin Pitera, 2014. "The least squares method for option pricing revisited," Papers 1404.7438,, revised Nov 2015.
    2. Daniel Zanger, 2013. "Quantitative error estimates for a least-squares Monte Carlo algorithm for American option pricing," Finance and Stochastics, Springer, vol. 17(3), pages 503-534, July.
    3. S'ergio C. Bezerra & Alberto Ohashi & Francesco Russo, 2017. "Discrete-type approximations for non-Markovian optimal stopping problems: Part II," Papers 1707.05250,, revised Jan 2018.


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:apmtfi:v:16:y:2009:i:2:p:123-150. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Chris Longhurst). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.