Efficient Rank Reduction of Correlation Matrices
24 Pages Posted: 29 Mar 2006
Date Written: April 3, 2005
Abstract
Geometric optimisation algorithms are developed that efficiently find the nearest low-rank correlation matrix. We show, in numerical tests, that our methods compare favourably to the existing methods in the literature. The connection with the Lagrange multiplier method is established, along with an identification of whether a local minimum is a global minimum. An additional benefit of the geometric approach is that any weighted norm can be applied. The problem of finding the nearest low-rank correlation matrix occurs as part of the calibration of multi-factor interest rate market models to correlation.
Keywords: geometric optimisation, correlation matrix, Rank, LIBOR market model
Keywords: Geometric optimisation, Correlation matrix, Rank, LIBOR market model
JEL Classification: M, G3, C61, G13, E43
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
Efficient Rank Reduction of Correlation Matrices
By Igor Grubisic and Raoul Pietersz
-
Optimal Solution of the Nearest Correlation Matrix Problem by Minimization of the Maximum Norm
-
A Comparison of Single-Factor Markov-Functional and Multi-Factor Market Models
By Raoul Pietersz and Antoon Pelsser
-
A Comparison of Single Factor Markov-Functional and Multi Factor Market Models
By R. Pietersz and Antoon Pelsser
-
A Note on Solution of the Nearest Correlation Matrix Problem by von Neumann Matrix Divergence
-
Finding a Valid FX Covariance Matrix in the BS World
By Maxim Bouev
-
Importance Sampling and Mm-Algorithms with Applications to Options Pricing