Research Article | Open Access

# The Adjoint Method for the Inverse Problem of Option Pricing

**Academic Editor:**Yang Tang

#### Abstract

The estimation of implied volatility is a typical PDE inverse problem. In this paper, we propose the model for identifying the implied volatility. The optimal volatility function is found by minimizing the cost functional measuring the discrepancy. The gradient is computed via the adjoint method which provides us with an exact value of the gradient needed for the minimization procedure. We use the limited memory quasi-Newton algorithm (L-BFGS) to find the optimal and numerical examples shows the effectiveness of the presented method.

#### 1. Introduction

An option is classified as either a call option or a put option. A call (or put) option is a contract which gives its holder the right to buy (or sell) a prescribed asset, known as the underlying asset, by a certain date (expiration date) for predetermined price (commonly called the strike price or exercise price). The revolution in trading and pricing derivative securities began in the early 1970s. In 1973, Black and Scholes [1] published their seminal papers on the theory of option pricing and obtained the partial differential equation depicting the option prices: where , and is the value of option price. The asset price is modeled to satisfy the Geometric Brownian motion, is the volatility, is the riskless interest rate, and is the maturity.

The payoff function at maturity and boundary conditions are given by where is the strike price. The analytical solution of the European call option is where

The option prices are functions of five parameters: , , , , and . Except for the volatility, the other four parameters , , , and are assumed or can be directly observed in the market. If the volatility is a constant, (1) becomes the classical Black-Scholes model. However, in the actual market volatility is changing [2, 3]. Volatility is a measure of the amount of flaction in the asset prices, that is, a measure of the randomness. It is necessary to measure it accurately in portfolio, asset pricing, risk management, and monetary policy. The estimation of volatility has been an important research topic of modern financial markets.

The volatility value implied by an observed option price is called the implied volatility. In market, empirical studies have revealed that no constant or merely time dependent local volatility function is consistent with most sets of market quotes; such phenomena are commonly called the volatility smile by market practitioners. In this paper, we are interested in the inverse problem of option pricing (IPOP). One possibility to explain the volatility smiles in Black-Scholes model is to use a deterministic function of underlying asset price and time ; that is, . We only discuss the case of on European call options.

The inverse problem of option pricing was first considered by Dupire [4]. He obtained a local volatility formula for all strike prices and maturities; however it is instable. Bharadia et al. [5] derived a simple volatility formula that does not require the option to be exactly at-the-money. Quasi-iterative technique for computing the implied volatility was proposed by Chance [6]. Chambers and Nawalkha [7] restricted Chance’s Taylor expansion to be only in volatility, improving its accuracy. Utilizing the third-order Taylor series expansion, Li [8] developed a new close formula of implied volatility. Ballestra and Cecere [9] proposed a highly efficient approach to compute the volatility of the Fractional Brownian Motion implied by American options. Research results concerning inverse problem of option pricing with Tikhonov regularization [10] strategies have been intensively published in recent years; see, for example, Chiarella et al. [11], Crépey [12], Deng et al. [13], Egger and Engl [14], Isakov [15], Jiang and Tao [16], Leland [17], Lagnado and Osher [18], Ngnepieba [19], and references therein. However, the classical Tikhonov regularization may oversmooth the solution of the origin problem. If the exact solution is nonsmooth or even has some singularities, the regularized solution cannot approximate effectively. These shortcomings will blur the edge of the restored image in image processing. Based on the advantage that the total variation (TV) regularization can preserve the edge of the image, Rudin et al. [20] proposed the model (also called the ROF model):

Considering the jump, overnight, and weekend effect [21, 22] of volatility, the total variation regularization might be able to depict the properties of volatility better. So whether the TV regularization strategy could be applied to identify the implied volatility is a question worth pondering.

fidelity-based model has many desirable and unexpected consequences in applications, such as data-driven parameter selection and multiscale image decomposition. Since the TV regularization should be used in the second step in order to reconstruct jump discontinuities in inverse problem, the reasonable choice of fidelity in the first step is the fidelity. In this paper, we consider the minimization of TV regularization under fidelity. The adjoint method provides us with an exact value of the gradient needed for the minimization procedure.

This paper is organized as follows. In the next section, we put forward the model for determining the implied volatility. In Section 3, we deduce the semidiscrete form of the Black-Scholes equation and introduce the adjoint model. Time discretization and the L-BFGS algorithm [23] are given in Section 4. In Section 5, we present a selection of numerical examples. In the last section, we give some remarks to conclude the paper.

#### 2. Total Variation Regularization Model

Let and be Hilbert spaces. The standard form of an inverse problem is as follows. Give and ; find such that , where is a nonlinear operator between and . Recall that an inverse problem is well posed if and only if the three conditions of Hadamard are satisfied: the existence, uniqueness, and continuous dependence of the solutions. Most inverse problems are ill posed.

We assume that only noisy data of the exact data is available. To obtain a well-posed problem, the classical Tikhonov regularization strategy is minimizing

In this section we consider the problem of inferring a local volatility function from the observed option prices (take call option for example). Equation (1) is described in an infinite domain which makes it difficult to obtain numerical solutions. We replace the region with the finite rectangle , where is the suitable chosen positive number representing the final value of the asset price; then we have In the current work, we assume that the market prices for a series of options are known, where is the observed market prices of the options with exercise dates () and strike prices (). We would like to estimate the volatility function that satisfies the Black-Scholes model (7) using this set of the observations.

In [18] Lagnado and Osher determined this inverse problem by using Tikhonov regularization strategy, that is, attempting to minimise where denotes the gradient operator. This regularization strategy proposed by Lagnado and Osher was just for one fixed value of underlying asset , at one fixed point in time . There is no guarantee that the value of calculated by this approach will be correct either for other underlying assets or at future times; there is also no guarantee that volatility will be positive everywhere.

Based on their work, Chiarella et al. [11] modified the objective functional as follows: where is the current time.

As we know, Tiknonov regularization may oversmooth the solution, so it cannot preserve the singularities of the solution well. In image processing this shortcoming will blur the edge of the restored image. To over this defect, Rudin et al. [20] proposed the total variation regularization strategy. Considering the jump, overnight, and weekend effect of the volatility, we introduce the following optimal control problem ( model): where denotes the regularization parameter, is the corresponding observations, is the related vector of prices in the Black-Scholes model with volatility function , and denotes the gradient, in this paper, .

To avoid the case in the flat area, as is done in image processing, the problem (10) is usually approximated by using the problem where and are two positive parameters which should usually be taken as a constant, for example, .

#### 3. Semidiscretization and Adjoint Model

The vega will appear in the optimal necessary condition if we compute the gradient of cost function directly. The vega (sometimes called kappa) of derivatives is the rate of change of its value with respect to the volatility of the underlying asset. Chiarella et al. [11] determined the vega by using the Black-Scholes formula as an approximation: however, it is not an exact value. In this paper, we introduce the adjoint method [19] which provides us with an exact value of the gradient needed for the minimization procedure.

We apply a uniform grid for the computational domain ; let Moreover, we use the notation where The first-order and second-order finite differences are used to approximate the space partial derivative and in Black-Scholes equation: Then, we have (we replace by for convenience sake) this leads to the following semidiscrete equation:

is a tridiagonal matrix with nonzero elements defined as follows: Indeed for ; this property guarantees that the space discretization does not cause undesired oscillations into the numerical solution. Equation (18) can be written as

The directional derivative of option price , also called the sensitivity in financial theory context, is where is the perturbation on . This combined with (20) implies

Similarly, the directional derivative of the cost function is

Introducing the adjoint variable , we have by using integration by parts, the above equation is integrated between and : If we define , the adjoint variable is the solution of the equation then we have

So the directional derivative of the cost function can be written as follows: thus, the gradient of the cost function with respect to the control variable is

#### 4. Time Discretization and Algorithm

Considering the stability and high accuracy of the Crank-Nicolson time discretization scheme which can be interpreted as the average of the explicit and implicit Euler schemes, the time discretization of the semidiscrete equation (20) can be written as then we have The above discrete scheme is second-order accurate and unconditionally stable. Let the boundary condition , , ; we also use this scheme for the discrete of adjoint equation (26): thus

Let ; (33) can be written as is a tridiagonal matrix with nonzero elements:

The discrete form of the gradient is given by where .

The solution of the minimization problem (11) could be computed by Newton’s method: where the inverse Hessian is approximated by L-BFGS formula.

We first need to introduce some notations. The iterates will be denoted by and we define , , . The method uses the inverse BFGS formula in the form where and .

*Algorithm 1 ( model for solving the implied volatility). ** **Step 1*. Choose a function . This will be the initial approximation to the true volatility .*Step 2*. Give the initialization value , , , , , , , , and .*Step 3*. Determine and by the Black-Scholes formula using :
*Step 4*. Let ; is the solution of the following linear equation:
and is computed by
where and are defined in (19) and (35).*Step 5*. Compute , ; then
where satisfies the Wolfe condition:
We always try the step length first. *Step 6*. If , end; else go to next step. *Step 7*. Let ; update times using the pairs ; that is, let
*Step 8*. Set and go to Step 4.

In this paper, we only discuss the estimation of implied volatility on European call options. The model and adjoint method are still valid in the case of put options.

#### 5. Numerical Experiments

In this section, we present numerical experiments to illustrate the model and adjoint method presented in the previous sections. First, we assume that the true volatility function is defined as

In numerical experiments, the interest rate , ; we consider only one time to option maturity . We take , , , and . Figure 1 displays the true volatility function.

The observed market prices are obtained by solving the Black-Scholes equation with the true volatility. Figure 2 displays .

We solve the optimal volatility by Algorithm 1; Figure 3 shows the comparison between the true volatility and the optimal estimated ,.

Our total variation regularization strategy has three advantages: the first one is it contains no terms involving the Dirac delta function [24] compared with Lagnado and Osher’s model [18]; the second is that the total variation regularization can maintain the singularities of the solution better (); the third is that the gradient is computed via the adjoint method which provides us with an exact value of the gradient needed for the minimization.

#### 6. Conclusion

A lot of research works have been made to determine the implied volatility by regularization strategies. Based on the advantages and great success of the total variation regularization strategy in image processing, in this paper, we propose the model for solving the implied volatility under the framework of the Black-Scholes model. We estimate implied volatility by solving an optimal control problem and the gradient is computed via the adjoint method. We use the limited memory quasi-Newton algorithm (L-BFGS) to find the optimal solution. Furthermore, the results of numerical experiments are presented.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This work was supported by the NNSF of China (nos. 60872129 and 11271117) and the Science and Technology Project of Changsha City of China (no. K1207023-31).

#### References

- F. Black and M. Scholes, “The pricing of options and corporate liabilities,”
*Journal of Political Economy*, vol. 81, pp. 637–654, 1973. View at: Google Scholar - J. R. Franks and E. S. Schwartz, “The stochastic behavior of market variance implied in the price of index options,”
*The Economics Journal*, vol. 101, pp. 1460–1475, 1991. View at: Google Scholar - R. Heynen, “An empirical investigation of observed smile patterns,”
*Review Futures Markets*, vol. 13, pp. 317–353, 1994. View at: Google Scholar - B. Dupire, “Pricing with a smile,”
*Risk*, vol. 7, pp. 18–20, 1994. View at: Google Scholar - M. A. Bharadia, N. Christofides, and G. R. Salkin, “Computing the Black-Scholes implied volatility,”
*Advances in Futures and Options Research*, 8, pp. 15–29, 1996. View at: Google Scholar - D. M. Chance, “A generalized simple formula to compute the implied volatility,”
*The Financial Review*, vol. 31, pp. 859–867, 1996. View at: Google Scholar - D. R. Chambers and S. K. Nawalkha, “An improved approach to computing implied volatility,”
*The Financial Review*, vol. 38, pp. 89–100, 2001. View at: Google Scholar - S. Li, “A new formula for computing implied volatility,”
*Applied Mathematics and Computation*, vol. 170, no. 1, pp. 611–625, 2005. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - L. V. Ballestra and L. Cecere, “A numerical method to compute the volatility of the fractional Brownian motion implied by American options,”
*International Journal of Applied Mathematics*, vol. 26, no. 2, pp. 203–220, 2013. View at: Publisher Site | Google Scholar | MathSciNet - A. N. Tikhonov, A. S. Leonov, and A. G. Yagola,
*Nonlinear Ill-Posed Problems*, Chapman & Hall, London, UK, 1998. View at: MathSciNet - C. Chiarella, M. Craddock, and N. El-Hassan, “The calibration of stock option pricing models using inverse problem methodology,”
*QFRQ Research Papers*, UTS, Sydney, Australia, 2000. View at: Google Scholar - S. Crépey, “Calibration of the local volatility in a trinomial tree using Tikhonov regularization,”
*Inverse Problems*, vol. 19, no. 1, pp. 91–127, 2003. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - Z. C. Deng, J. N. Yu, and L. Yang, “An inverse problem of determining the implied volatility in option pricing,”
*Journal of Mathematical Analysis and Applications*, vol. 340, no. 1, pp. 16–31, 2008. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - H. Egger and H. W. Engl, “Tikhonov regularization applied to the inverse problem of option pricing: convergence analysis and rates,”
*Inverse Problems*, vol. 21, no. 3, pp. 1027–1045, 2005. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - V. Isakov, “The inverse problem of option pricing,” in
*Recent Development in Theories and Numerics*, pp. 47–55, World Scientific Publishing, Singapore, 2003. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - L. S. Jiang and Y. S. Tao, “Identifying the volatility of underlying assets from option prices,”
*Inverse Problems*, vol. 17, no. 1, pp. 137–155, 2001. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - H. E. Leland, “Option pricing and replication with transaction costs,”
*The Journal of Finance*, vol. 40, pp. 1283–1301, 1985. View at: Google Scholar - R. Lagnado and S. Osher, “A technique for calibrating derivative security pricing models: numerical solution of an inverse problem,”
*Journal of Computational Finance*, vol. 1, pp. 13–25, 1997. View at: Google Scholar - P. Ngnepieba, “The adjoint method formulation for an inverse problem in the generalized Black-Scholes model,”
*Journal of Systemics Cybernetics and Informatics*, vol. 4, pp. 69–77, 2006. View at: Google Scholar - L. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation based noise removal algorithms,”
*Physica D*, vol. 60, no. 1–4, pp. 259–268, 1992. View at: Google Scholar - M. J. Boes, F. C. Drost, and B. J. M. Werker, “The impact of overnight periods on option pricing,”
*Journal of Financial and Quantitative Analysis*, vol. 42, no. 2, pp. 517–534, 2007. View at: Google Scholar - I. Ishida, M. McAleer, and K. Oya, “Estimating the leverage parameter of continuous-time stochastic volatility models using high frequency S&P500 and VIX,”
*Managerial Finance*, vol. 37, pp. 1048–1067, 2011. View at: Google Scholar - D. C. Liu and J. Nocedal, “On the limited memory BFGS method for large scale optimization,”
*Mathematical Programming*, vol. 45, no. 3, pp. 503–528, 1989. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - G. E. Andrews, R. Askey, and R. Roy,
*Special Functions*, vol. 71, Cambridge University Press, Cambridge, UK, 1999. View at: MathSciNet

#### Copyright

Copyright © 2014 Shou-Lei Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.