IDEAS home Printed from https://ideas.repec.org/a/bla/mathfi/v24y2014i1p156-172.html
   My bibliography  Save this article

A Method For Pricing American Options Using Semi-Infinite Linear Programming

Author

Listed:
  • Sören Christensen

Abstract

No abstract is available for this item.

Suggested Citation

  • Sören Christensen, 2014. "A Method For Pricing American Options Using Semi-Infinite Linear Programming," Mathematical Finance, Wiley Blackwell, vol. 24(1), pages 156-172, January.
    • Handle: RePEc:bla:mathfi:v:24:y:2014:i:1:p:156-172
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/j.1467-9965.2012.00523.x
    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.

    References listed on IDEAS

    as
    1. Martin Lauko & Daniel Sevcovic, 2010. "Comparison of numerical and analytical approximations of the early exercise boundary of the American put option," Papers 1002.0979, arXiv.org, revised Aug 2010.
    2. Martin B. Haugh & Leonid Kogan, 2004. "Pricing American Options: A Duality Approach," Operations Research, INFORMS, vol. 52(2), pages 258-270, April.
    3. L. C. G. Rogers, 2002. "Monte Carlo valuation of American options," Mathematical Finance, Wiley Blackwell, vol. 12(3), pages 271-286, July.
    4. Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Pathwise Optimization for Optimal Stopping Problems," Management Science, INFORMS, vol. 58(12), pages 2292-2308, December.
    5. Dayanik, Savas & Karatzas, Ioannis, 2003. "On the optimal stopping problem for one-dimensional diffusions," Stochastic Processes and their Applications, Elsevier, vol. 107(2), pages 173-212, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Soren Christensen & Albrecht Irle & Julian Peter Lemburg, 2021. "Flexible forward improvement iteration for infinite time horizon Markovian optimal stopping problems," Papers 2111.13443, arXiv.org.
    2. Louis Bhim & Reiichiro Kawai, 2018. "Smooth Upper Bounds For The Price Function Of American Style Options," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 21(01), pages 1-38, February.
    3. Miclo, Laurent & Villeneuve, Stéphane, 2019. "On the forward algorithm for stopping problems on continuous-time Markov chains," TSE Working Papers 19-1009, Toulouse School of Economics (TSE).
    4. David A. Goldberg & Yilun Chen, 2018. "Polynomial time algorithm for optimal stopping with fixed accuracy," Papers 1807.02227, arXiv.org, revised May 2024.
    5. Soren Christensen & Jan Kallsen & Matthias Lenga, 2020. "Are American options European after all?," Papers 2002.05571, arXiv.org.
    6. Sebastian Becker & Patrick Cheridito & Arnulf Jentzen & Timo Welti, 2019. "Solving high-dimensional optimal stopping problems using deep learning," Papers 1908.01602, arXiv.org, revised Aug 2021.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Helin Zhu & Fan Ye & Enlu Zhou, 2013. "Fast Estimation of True Bounds on Bermudan Option Prices under Jump-diffusion Processes," Papers 1305.4321, arXiv.org.
    2. Cosma, Antonio & Galluccio, Stefano & Pederzoli, Paola & Scaillet, Olivier, 2020. "Early Exercise Decision in American Options with Dividends, Stochastic Volatility, and Jumps," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 55(1), pages 331-356, February.
    3. Antonio Cosma & Stefano Galluccio & Paola Pederzoli & O. Scaillet, 2012. "Valuing American Options Using Fast Recursive Projections," Swiss Finance Institute Research Paper Series 12-26, Swiss Finance Institute.
    4. Mark Broadie & Weiwei Shen, 2016. "High-Dimensional Portfolio Optimization With Transaction Costs," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 19(04), pages 1-49, June.
    5. Bradley Sturt, 2021. "A nonparametric algorithm for optimal stopping based on robust optimization," Papers 2103.03300, arXiv.org, revised Mar 2023.
    6. Santiago R. Balseiro & David B. Brown, 2019. "Approximations to Stochastic Dynamic Programs via Information Relaxation Duality," Operations Research, INFORMS, vol. 67(2), pages 577-597, March.
    7. Helin Zhu & Fan Ye & Enlu Zhou, 2015. "Fast estimation of true bounds on Bermudan option prices under jump-diffusion processes," Quantitative Finance, Taylor & Francis Journals, vol. 15(11), pages 1885-1900, November.
    8. Daniel R. Jiang & Lina Al-Kanj & Warren B. Powell, 2020. "Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds," Operations Research, INFORMS, vol. 68(6), pages 1678-1697, November.
    9. David B. Brown & Martin B. Haugh, 2017. "Information Relaxation Bounds for Infinite Horizon Markov Decision Processes," Operations Research, INFORMS, vol. 65(5), pages 1355-1379, October.
    10. Denis Belomestny & John Schoenmakers, 2021. "From optimal martingales to randomized dual optimal stopping," Papers 2102.01533, arXiv.org.
    11. Christian Bender & Christian Gaertner & Nikolaus Schweizer, 2016. "Pathwise Iteration for Backward SDEs," Papers 1605.07500, arXiv.org, revised Jun 2016.
    12. Simon Scheidegger & Adrien Treccani, 2021. "Pricing American Options under High-Dimensional Models with Recursive Adaptive Sparse Expectations [Telling from Discrete Data Whether the Underlying Continuous-Time Model Is a Diffusion]," Journal of Financial Econometrics, Oxford University Press, vol. 19(2), pages 258-290.
    13. Soren Christensen, 2011. "A method for pricing American options using semi-infinite linear programming," Papers 1103.4483, arXiv.org, revised Jun 2011.
    14. Sebastian Becker & Patrick Cheridito & Arnulf Jentzen & Timo Welti, 2019. "Solving high-dimensional optimal stopping problems using deep learning," Papers 1908.01602, arXiv.org, revised Aug 2021.
    15. Volker Krätschmer & Marcel Ladkau & Roger J. A. Laeven & John G. M. Schoenmakers & Mitja Stadje, 2018. "Optimal Stopping Under Uncertainty in Drift and Jump Intensity," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1177-1209, November.
    16. Jérôme Lelong, 2018. "Dual pricing of American options by Wiener chaos expansion," Post-Print hal-01299819, HAL.
    17. Secomandi, Nicola & Seppi, Duane J., 2014. "Real Options and Merchant Operations of Energy and Other Commodities," Foundations and Trends(R) in Technology, Information and Operations Management, now publishers, vol. 6(3-4), pages 161-331, July.
    18. Fabian Dickmann & Nikolaus Schweizer, 2014. "Faster Comparison of Stopping Times by Nested Conditional Monte Carlo," Papers 1402.0243, arXiv.org.
    19. Ernst, Philip A. & Rogers, L.C.G. & Zhou, Quan, 2017. "The value of foresight," Stochastic Processes and their Applications, Elsevier, vol. 127(12), pages 3913-3927.
    20. repec:hum:wpaper:sfb649dp2006-051 is not listed on IDEAS
    21. Calypso Herrera & Florian Krach & Pierre Ruyssen & Josef Teichmann, 2021. "Optimal Stopping via Randomized Neural Networks," Papers 2104.13669, arXiv.org, revised Dec 2023.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:bla:mathfi:v:24:y:2014:i:1:p:156-172. See general information about how to correct material in RePEc.

    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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0960-1627 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.