Skip to main content
SpringerLink
Log in

SDP Relaxation of Arbitrage Pricing Bounds Based on Option Prices and Moments

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

This paper develops a semidefinite programming approach to computing bounds on the range of allowable absence of arbitrage prices for a European call option when option prices at other strikes and expirations are available and when moment related information on the underlying is known. The moment related information is incorporated in the problem through the fictitious prices of polynomial valued securities. The optimization then comes from relaxing a risk neutral pricing optimization problem in terms of moments of measures from a decomposition of the risk neutral pricing measure. We demonstrate this optimization formulation with computations using moment data from the standard Black-Scholes option pricing model and Merton’s jump diffusion model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Black, F., Scholes, M.: The pricing of options and corporate liabilities. J. Polit. Econ. 81, 637–659 (1973)

    Article  Google Scholar 

  2. Laurent, J.P., Leisen, D.: Building a consistent pricing model form observed option prices. In: Avellaneda, W.S.M. (ed.) Collected Papers of the New York University Mathematical Finance Seminar (2000)

  3. Carr, P., Madan, D.: A note on sufficient conditions for no arbitrage. Finance Res. Lett. 2, 125–130 (2005)

    Article  Google Scholar 

  4. Davis, M.H.A., Hobson, D.G.: The range of traded option prices. Math. Finance 17, 1–14 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  5. Lo, A.: Semiparametric upper bounds for option prices and expected payoffs. J. Financ. Econ. 19, 373–388 (1987)

    Article  Google Scholar 

  6. Bertsimas, D., Popescu, I.: On the relation between option and stock prices: A convex optimization approach. Oper. Res. 50(2), 358–374 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bertsimas, D., Popescu, I.: Optimal inequalities in probability theory: A convex optimization approach. SIAM J. Optim. 15(3), 780–804 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bertsimas, D., Popescu, I., Sethuraman, J.: Moment problems and semidefinite programming. In: Wolkovitz, H. (ed.) Semidefinite Programming, pp. 469–509 (2000)

  9. Smith, J.E.: Generalized Chebychev inequalities: Theory and applications in decision analysis. Oper. Res. 43, 807–825 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. d’Aspremont, A.: Shape constrained optimization with applications in finance and engineering. PhD thesis, Stanford University (2004)

  11. d’Aspremont, A., Ghaoui, L.E.: Static arbitrage bounds on basket option prices. Math. Program., Ser. A (2005)

  12. Laurence, P., Wang, T.: What’s a basket worth? Risk (2004)

  13. Laurence, P., Wang, T.: Sharp upper and lower bounds for basket options. Appl. Math. Finance 12, 253–282 (2005)

    Article  MATH  Google Scholar 

  14. Lasserre, J.B., Prieto-Rumeau, T., Zervos, M.: Pricing a class of exotic options via moments and SDP relaxations. Math. Finance 16(3), 469–494 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  15. Primbs, J.A.: Piecewise polynomial replication strategies and moment matrices in convex optimization based option pricing bounds. MS&E Working Paper, no. 06-11-81654-28 (2006)

  16. Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796–817 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  17. Curto, R.E., Fialkow, L.A.: Recursiveness, positivity, and truncated moment problems. Houst. J. Math. 17, 603–635 (1991)

    MATH  MathSciNet  Google Scholar 

  18. Curto, R.E., Fialkow, L.A.: The truncated complex k-moment problem. Trans. Am. Math. Soc. 352, 2825–2855 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Sturm, J.: SeDuMi: Version 1.05, October 2004

  20. Peaucelle, D., Henrion, D., Labit, Y., Taitz, K.: User’s Guide for SeDuMi Interface 1.04, September 2002

  21. Gotoh, J., Konno, H.: Bounding option prices by semidefinite programming: A cutting plane algorithm. Manag. Sci. 48, 665–678 (2002)

    Article  Google Scholar 

  22. Merton, R.C.: Option pricing when the underlying stock returns are discontinuous. J. Financ. Econ. 5, 125–144 (1976)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Management Science and Engineering, 444 Terman Engr. Ctr., Stanford, CA, 94305-4026, USA

    J. A. Primbs

Authors
  1. J. A. Primbs
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. A. Primbs.

Additional information

Communicated by D.G. Luanberger.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Primbs, J.A. SDP Relaxation of Arbitrage Pricing Bounds Based on Option Prices and Moments. J Optim Theory Appl 144, 137–155 (2010). https://doi.org/10.1007/s10957-009-9605-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-009-9605-5

Keywords

Search

Navigation