Rank Reduction of Correlation Matrices by Majorization

Raoul Pietersz () and Patrick Groenen ()

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 (search for similar items in EconPapers)
JEL-codes: G13 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-cmp and nep-fin
Date: 2005-02-11
Note: Type of Document - pdf; pages: 29
View list of references View citations in EconPapers

Downloads: (external link)
http://129.3.20.41/eps/fin/papers/0502/0502006.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Access Statistics for this paper

More papers in Finance from EconWPA
Series data maintained by EconWPA ().