🏠
Guest Not signed in

Fengler: non-parametric arb-free vol surface smoothing via Quadratic Programming (QP)

Given noisy quoted call prices, find the smoothest arb-free surface that's closest to them. A constrained Quadratic Program (QP) β€” minimise a quadratic objective subject to linear constraints β€” does the work; no parametric family is assumed.

Method · Fengler Smoothing
Intro

An options market-maker at any serious flow shop marks hundreds of strike-maturity combinations every session. When raw market quotes contain butterfly or calendar violations, the desk needs a smoothing layer that enforces no-arbitrage before any model calibration can run. Parametric fits like SVI break when the real smile has a shape the family cannot reproduce. Fengler (2009) solves this without choosing a smile shape: represent the surface as a cubic spline, then run a Quadratic Program (QP) to find the spline coefficients that best fit the quotes while satisfying no-arb constraints. One QP per maturity slice, solvable in milliseconds β€” everyday infrastructure at any options desk. This tutorial works through the butterfly constraint as a linear inequality and sets up the QP.

βœ“ Intro Β· expand
Independent · Legal