Quadratic Convergence for Valuing American Options Using a Penalty Method

The convergence of a penalty method for solving the discrete regularized American option valuation problem is studied. Sufficient conditions are derived which both guarantee convergence of the nonlinear penalty iteration and ensure that the iterates converge monotonically to the solution. These conditions also ensure that the solution of the penalty problem is an approximate solution to the discrete linear complementarity problem. The efficiency and quality of solutions obtained using the implicit penalty method are compared with those produced with the commonly used technique of handling the American constraint explicitly. Convergence rates are studied as the timestep and mesh size tend to zero. It is observed that an implicit treatment of the American constraint does not converge quadratically (as the timestep is reduced) if constant timesteps are used. A timestep selector is suggested which restores quadratic convergence.

[1]  P. Wilmott,et al.  Some mathematical results in the pricing of American options , 1993, European Journal of Applied Mathematics.

[2]  P. Forsyth,et al.  Valuation of segregated funds: shout options with maturity extensions , 2001 .

[3]  Phelim P. Boyle,et al.  Bumping Up Against the Barrier with the Binomial Method , 1994 .

[4]  Michael A. H. Dempster,et al.  Fast Numerical Valuation of American, Exotic and Complex Options , 1997 .

[5]  Christian Kanzow,et al.  Some Noninterior Continuation Methods for Linear Complementarity Problems , 1996, SIAM J. Matrix Anal. Appl..

[6]  Jong-Shi Pang,et al.  A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems , 1991, Math. Program..

[7]  Peter A. Forsyth,et al.  Robust numerical methods for PDE models of Asian options , 1997 .

[8]  R. Rannacher.  Finite element solution of diffusion problems with irregular data , 1984 .

[9]  C. M. Elliott,et al.  Weak and variational methods for moving boundary problems , 1982 .

[10]  Numerische,et al.  Numerical Solution of the Obstacle Problem by the Penalty Method Part II . Time-Dependent Problems , .

[11]  Kunibert G. Siebert,et al.  W1∞-convergence of the discrete free boundary for obstacle problems , 2000 .

[12]  T. Coleman,et al.  An Object-Oriented Framework For Valuing Shout Options on High-Performance Computer Architectures , 2003 .

[13]  P. A. FORSYTHy,et al.  Discrete Asian Barrier Options , 1998 .

[14]  Christian Kanzow,et al.  Jacobian Smoothing Methods for Nonlinear Complementarity Problems , 1999, SIAM J. Optim..

[15]  Jong-Shi Pang,et al.  A mathematical programming with equilibrium constraints approach to the implied volatility surface of American options , 2000 .

[16]  C. Los.  OPTION PRICING I , 2000 .

[17]  Peter A. Forsyth,et al.  A finite volume approach for contingent claims valuation , 2001 .

[18]  J. Zowe,et al.  An iterative two-step algorithm for linear complementarity problems , 1994 .

[19]  M. Avellaneda,et al.  Pricing and hedging derivative securities in markets with uncertain volatilities , 1995 .

[20]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[21]  J. Hull.  Options, Futures, and Other Derivatives , 1989 .

[22]  Rachel Kuske,et al.  Optimal exercise boundary for an American put option , 1998 .

[23]  Jong-Shi Pang,et al.  Nonsmooth Equations: Motivation and Algorithms , 1993, SIAM J. Optim..

[24]  Peter A. Forsyth,et al.  Penalty methods for American options with stochastic volatility , 1998 .

[25]  A. Friedman.  Variational principles and free-boundary problems , 1982 .

[26]  Nimrod Megiddo,et al.  A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.

[27]  Andreas Fischer,et al.  On finite termination of an iterative method for linear complementarity problems , 1996, Math. Program..

[28]  Ricardo H. Nochetto,et al.  SharpL∞-error estimates for semilinear elliptic problems with free boundaries , 1989 .

[29]  Joakim Becker,et al.  A second order backward difference method with variable steps for a parabolic problem , 1998 .

[30]  P. Forsyth,et al.  PDE methods for pricing barrier options , 2000 .

[31]  Michal Kočvara,et al.  Nonsmooth approach to optimization problems with equilibrium constraints : theory, applications, and numerical results , 1998 .

[32]  C. SIAMJ..  A NEW NONSMOOTH EQUATIONS APPROACH TO NONLINEAR COMPLEMENTARITY PROBLEMS∗ , 1997 .

[33]  Thomas F. Coleman,et al.  A Newton Method for American Option Pricing , 2002 .

[34]  P. Forsyth,et al.  Shout options: a framework for pricing contracts which can be modified by the investor , 2001 .

[35]  R. Scholz,et al.  Numerical solution of the obstacle problem by the penalty method , 1986 .

[36]  Claes Johnson.  Numerical solution of partial differential equations by the finite element method , 1988 .

[37]  Guofu Zhou,et al.  On the Rate of Convergence of Discrete‐Time Contingent Claims , 2000 .