Skip to main content

Semidefinite Programming Approaches for Bounding Asian Option Prices

  • Chapter
Computational Methods in Financial Engineering

Abstract

Semidefinite programming (SDP) approaches are considered for obtaining bounds for the price of an arithmetic average Asian option. A method for computing the moments of the distribution of prices is developed which enables the method of Bertsimas and Popescu to be extended for the case of the Asian option. In particular, several SDP formulations for upper and lower bounds of the price of an Asian option are given based on different representations of the payoffs of the option. The formulations are amenable to standard SDP computational methods.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bertsimas, D. and Popescu, I.: 2002, On the relation between option and stock prices: a convex optimization approach, Operations Research 50(2), 358–374.

    Article  Google Scholar 

  • Black, F. and Scholes, M.: 1973, The pricing of options and corporate liabilities, Journal of Political Economy 81, 637–654.

    Article  Google Scholar 

  • Boyle, P.P. and Emanuel, D.: 1980, The pricing of options on the generalized means, Working paper, University of British Columbia, Vancouver, B.C., Canada.

    Google Scholar 

  • Dalakouras, G.V.: 2004, Computation of the moments of the continuously sampled arithmetic average, Working paper, Department of Mathematics, University of Michigan, Ann Arbor.

    Google Scholar 

  • Dufresne, D.: 1989, Weak convergence of random growth processes with applications to insurance, Insurance Mathematics & Economics 8, 187–201.

    Article  Google Scholar 

  • Geman, H. and Yor, M.: 1993, Bessel processes, Asian options and perpetuities, Mathematical Finance 3(4), 349–375.

    Article  Google Scholar 

  • Glasserman, P., Heidelberger, P. and Shahabuddin, P.: 1999, Asymptotically optimal importance sampling and stratification for pricing path dependent options, Mathematical Finance 9, 117–152.

    Article  Google Scholar 

  • Gotoh, J.Y. and Konno, H.: 2002, Bounding option prices by semidefmite programming: a cutting plane algorithm, Management Science 48, 665–678.

    Article  Google Scholar 

  • Hull, J.C.: 2003, Options, Futures, and Other Derivatives, Prentice Hall, Englewood Cliffs, NJ. (5th ed.).

    Google Scholar 

  • Ishii, K.: 1963, On sharpness of Chebyshev-type inequalities, Ann Inst. Statist Meth. 14, 185–197.

    Google Scholar 

  • Pardalos, P.M. and Wolkowicz, H. (eds): 1998, Topics in Semidefinite and Interior-Point Methods, Vol. 18 of Fields Institute Communications Series, American Mathematical Society.

    Google Scholar 

  • Ramana, M. and Pardalos, P.M.: 1996, Semidefinite programming, in T. Terlaky (ed.), Interior Point Methods of Mathematical Programming, Kluwer Academic Publishers, Dordrecht, pp. 369–398.

    Google Scholar 

  • Rogers, L.C. and Shi, Z.: 1995, The value of an Asian option, Journal of Applied Probability 32, 1077–1088.

    Article  Google Scholar 

  • Turnbull, S.M. and Wakeman, L.M.: 1991, A quick algorithm for pricing European average options, Journal of Financial and Quantitative Analysis 26, 377–389.

    Article  Google Scholar 

  • Vandenberghe, L. and Boyd, S.: 1996, Semidefinite programming, SIAM Remew 38, 49–95.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Dalakouras, G.V., Kwon, R.H., Pardalos, P.M. (2008). Semidefinite Programming Approaches for Bounding Asian Option Prices. In: Kontoghiorghes, E.J., Rustem, B., Winker, P. (eds) Computational Methods in Financial Engineering. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77958-2_6

Download citation

Publish with us

Policies and ethics