Correlation stress testing for value-at-risk: an unconstrained convex optimization approach

Correlation stress testing is employed in several financial models for determining the value-at-risk (VaR) of a financial institution’s portfolio. The possible lack of mathematical consistence in the target correlation matrix, which must be positive semidefinite, often causes breakdown of these models. The target matrix is obtained by fixing some of the correlations (often contained in blocks of submatrices) in the current correlation matrix while stressing the remaining to a certain level to reflect various stressing scenarios. The combination of fixing and stressing effects often leads to mathematical inconsistence of the target matrix. It is then naturally to find the nearest correlation matrix to the target matrix with the fixed correlations unaltered. However, the number of fixed correlations could be potentially very large, posing a computational challenge to existing methods. In this paper, we propose an unconstrained convex optimization approach by solving one or a sequence of continuously differentiable (but not twice continuously differentiable) convex optimization problems, depending on different stress patterns. This research fully takes advantage of the recently developed theory of strongly semismooth matrix valued functions, which makes fast convergent numerical methods applicable to the underlying unconstrained optimization problem. Promising numerical results on practical data (RiskMetrics database) and randomly generated problems of larger sizes are reported.

[1]  Paul Tseng,et al.  Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems , 2003, SIAM J. Optim..

[2]  B. Curtis Eaves,et al.  On the basic theorem of complementarity , 1971, Math. Program..

[3]  J. Frédéric Bonnans,et al.  Perturbation Analysis of Optimization Problems , 2000, Springer Series in Operations Research.

[4]  N. Higham Computing the nearest correlation matrix—a problem from finance , 2002 .

[5]  Defeng Sun,et al.  A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix , 2006, SIAM J. Matrix Anal. Appl..

[6]  R. Rebonato,et al.  The most general methodology for creating a valid correlation matrix for risk management and option pricing purposes , 2000 .

[7]  Alec N. Kercheval ON REBONATO AND JÄCKEL ’ S PARAMETRIZATION METHOD FOR FINDING NEAREST CORRELATION MATRICES , 2008 .

[8]  Jérôme Malick,et al.  A Dual Approach to Semidefinite Least-Squares Problems , 2004, SIAM J. Matrix Anal. Appl..

[9]  E. H. Zarantonello Projections on Convex Sets in Hilbert Space and Spectral Theory: Part I. Projections on Convex Sets: Part II. Spectral Theory , 1971 .

[10]  Pierre Giot,et al.  Market Models: A Guide to Financial Data Analysis , 2003 .

[11]  R. Rockafellar Conjugate Duality and Optimization , 1987 .

[12]  Jan W Dash Quantitative Finance and Risk Management: A Physicist's Approach , 2004 .

[13]  V. Arnold ON MATRICES DEPENDING ON PARAMETERS , 1971 .

[14]  Defeng Sun,et al.  Semismooth Matrix-Valued Functions , 2002, Math. Oper. Res..

[15]  R. Tyrrell Rockafellar,et al.  Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..

[16]  Stephen P. Boyd,et al.  Least-Squares Covariance Matrix Adjustment , 2005, SIAM J. Matrix Anal. Appl..

[17]  Thomas J. Latta Stress Testing in a Value at Risk Framework , 1999 .

[18]  Defeng Sun,et al.  The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications , 2006, Math. Oper. Res..

[19]  Defeng Sun,et al.  The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming , 2008, Math. Program..

[20]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[21]  Dawn Hunter Forecasting portfolio risk in normal and stressed markets , 2001 .

[22]  Ingo Fender,et al.  An International Survey of Stress Tests , 2001 .

[23]  R. Rebonato,et al.  The Most General Methodology to Create a Valid Correlation Matrix for Risk Management and Option Pricing Purposes , 2011 .

[24]  F. Clarke Optimization And Nonsmooth Analysis , 1983 .

[25]  Nicos Christofides,et al.  Correlation stress testing for value-at-risk , 2003 .

[26]  Defeng Sun,et al.  A Dual Optimization Approach to Inverse Quadratic Eigenvalue Problems with Partial Eigenstructure , 2007, SIAM J. Sci. Comput..

[27]  Defeng Sun,et al.  Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems , 2003, Math. Oper. Res..

[28]  D. Brigo,et al.  Parameterizing correlations: a geometric interpretation , 2007 .

[29]  Liqun Qi,et al.  Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..

[30]  Begoña Subiza,et al.  A note on adjusting correlation matrices , 2002 .

[31]  R. Rockafellar Monotone Operators and the Proximal Point Algorithm , 1976 .

[32]  Michael L. Overton,et al.  Complementarity and nondegeneracy in semidefinite programming , 1997, Math. Program..

[33]  M. Todd,et al.  Inexact primal-dual path-following algorithms for a special class of convex quadratic SDP and related problems , 2005 .