IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v316y2024i1p19-35.html
   My bibliography  Save this article

An efficient and provable sequential quadratic programming method for American and swing option pricing

Author

Listed:
  • Shen, Jinye
  • Huang, Weizhang
  • Ma, Jingtang

Abstract

A sequential quadratic programming numerical method is proposed for American option pricing based on the variational inequality formulation. The variational inequality is discretized using the θ-method in time and the finite element method in space. The resulting system of algebraic inequalities at each time step is solved through a sequence of box-constrained quadratic programming problems, with the latter being solved by a globally and quadratically convergent, large-scale suitable reflective Newton method. It is proved that the sequence of quadratic programming problems converges with a constant rate under a mild condition on the time step size. The method is general in solving the variational inequalities for the option pricing with many styles of optimal stopping and complex underlying asset models. In particular, swing options and stochastic volatility and jump diffusion models are studied. Numerical examples are presented to confirm the effectiveness of the method.

Suggested Citation

  • Shen, Jinye & Huang, Weizhang & Ma, Jingtang, 2024. "An efficient and provable sequential quadratic programming method for American and swing option pricing," European Journal of Operational Research, Elsevier, vol. 316(1), pages 19-35.
    • Handle: RePEc:eee:ejores:v:316:y:2024:i:1:p:19-35
    DOI: 10.1016/j.ejor.2023.11.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723008512
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.11.012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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:eee:ejores:v:316:y:2024:i:1:p:19-35. 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.

    We have no bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.