A Sequential Quadratic Programming Method for Volatility Estimation in Option Pricing
Our goal is to identify the volatility function in Dupire's equation from given option prices. Following an optimal control approach in a Lagrangian framework, we propose a globalized sequential quadratic programming (SQP) algorithm with a modified Hessian - to ensure that every SQP step is a descent direction - and implement a line search strategy. In each level of the SQP method a linear-quadratic optimal control problem with box constraints is solved by a primal-dual active set strategy. This guarantees L1 constraints for the volatility, in particular assuring its positivity. The proposed algorithm is founded on a thorough first- and second-order optimality analysis. We prove the existence of local optimal solutions and of a Lagrange multiplier associated with the inequality constraints. Furthermore, we prove a sufficient second-order optimality condition and present some numerical results underlining the good properties of the numerical scheme.
|Date of creation:||29 Mar 2006|
|Date of revision:|
|Contact details of provider:|| Postal: Fach D 147, D-78457 Konstanz|
Web page: http://cofe.uni-konstanz.de
More information through EDIRC
|Order Information:|| Web: http://cofe.uni-konstanz.de Email: |
When requesting a correction, please mention this item's handle: RePEc:knz:cofedp:0602. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ingmar Nolte)
If references are entirely missing, you can add them using this form.