Parameter identification in financial market models with a feasible point SQP algorithm
From MaRDI portal
Publication:429503
DOI10.1007/s10589-010-9369-8zbMath1241.91147OpenAlexW2092924145MaRDI QIDQ429503
Ekkehard W. Sachs, F. Gerlich, A. M. Giese, Jan H. Maruhn
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9369-8
parameter identificationstochastic volatility modelsfeasibility perturbed sequential quadratic programming
Filtering in stochastic control theory (93E11) Quadratic programming (90C20) Financial applications of other theories (91G80)
Related Items (2)
Full and fast calibration of the Heston stochastic volatility model ⋮ Adjoint-based Monte Carlo calibration of financial methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- The Pricing of Options and Corporate Liabilities
- Identification of the local speed function in a Lévy model for option pricing
- Computing a nearest symmetric positive semidefinite matrix
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- Calibration of local volatility using the local and implied instantaneous variance
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Linear Matrix Inequalities in System and Control Theory
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- Trust Region Methods
- A Feasible Trust-Region Sequential Quadratic Programming Algorithm
- Computational Methods for Option Pricing
- A Closed-Form Solution for Options with Stochastic Volatility with Applications to Bond and Currency Options
This page was built for publication: Parameter identification in financial market models with a feasible point SQP algorithm