Rank Reduction of Correlation Matrices by Majorization
29 Pages Posted: 25 Mar 2004
Date Written: September 18, 2004
Abstract
A novel algorithm is developed for the problem of finding a low-rank correlation matrix nearest to a given correlation matrix. The algorithm is based on majorization and, therefore, it is globally convergent. The algorithm is computationally efficient, is straightforward to implement, and can handle arbitrary weights on the entries of the correlation matrix. A simulation study suggests that majorization compares favourably with competing approaches in terms of the quality of the solution within a fixed computational time. The problem of rank reduction of correlation matrices occurs when pricing a derivative dependent on a large number of assets, where the asset prices are modelled as correlated log-normal processes. Mainly, such an application concerns interest rates.
Keywords: rank, correlation matrix, majorization, lognormal price processes, low-rank approximation
JEL Classification: G13
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
-
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