Quadratic Programming

Tail-Safe Stochastic-Control SPX-VIX Hedging: A White-Box Bridge Between AI Sensitivities and Arbitrage-Free Market Dynamics ArXiv ID: 2510.15937 “View on arXiv” Authors: Jian’an Zhang Abstract We present a white-box, risk-sensitive framework for jointly hedging SPX and VIX exposures under transaction costs and regime shifts. The approach couples an arbitrage-free market teacher with a control layer that enforces safety as constraints. On the market side, we integrate an SSVI-based implied-volatility surface and a Cboe-compliant VIX computation (including wing pruning and 30-day interpolation), and connect prices to dynamics via a clipped, convexity-preserving Dupire local-volatility extractor. On the control side, we pose hedging as a small quadratic program with control-barrier-function (CBF) boxes for inventory, rate, and tail risk; a sufficient-descent execution gate that trades only when risk drop justifies cost; and three targeted tail-safety upgrades: a correlation/expiry-aware VIX weight, guarded no-trade bands, and expiry-aware micro-trade thresholds with cooldown. We prove existence/uniqueness and KKT regularity of the per-step QP, forward invariance of safety sets, one-step risk descent when the gate opens, and no chattering with bounded trade rates. For the dynamics layer, we establish positivity and second-order consistency of the discrete Dupire estimator and give an index-coherence bound linking the teacher VIX to a CIR-style proxy with explicit quadrature and projection errors. In a reproducible synthetic environment mirroring exchange rules and execution frictions, the controller reduces expected shortfall while suppressing nuisance turnover, and the teacher-surface construction keeps index-level residuals small and stable. ...

Indices of quadratic programs over reproducing kernel Hilbert spaces for fun and profit ArXiv ID: 2412.18201 “View on arXiv” Authors: Unknown Abstract We give an abstract perspective on quadratic programming with an eye toward long portfolio theory geared toward explaining sparsity via maximum principles. Specifically, in optimal allocation problems, we see that support of an optimal distribution lies in a variety intersect a kind of distinguished boundary of a compact subspace to be allocated over. We demonstrate some of its intelligence by using it to solve mazes and interpret such behavior as the underlying space trying to understand some hypothetical platonic index for which the capital asset pricing model holds. ...

Position-building in competition with real-world constraints ArXiv ID: 2409.15459 “View on arXiv” Authors: Unknown Abstract This paper extends the optimal-trading framework developed in arXiv:2409.03586v1 to compute optimal strategies with real-world constraints. The aim of the current paper, as with the previous, is to study trading in the context of multi-player non-cooperative games. While the former paper relies on methods from the calculus of variations and optimal strategies arise as the solution of partial differential equations, the current paper demonstrates that the entire framework may be re-framed as a quadratic programming problem and cast in this light constraints are readily incorporated into the calculation of optimal strategies. An added benefit is that two-trader equilibria may be calculated as the end-points of a dynamic process of traders forming repeated adjustments to each other’s strategy. ...