Rank reduction of correlation matrices by majorization
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. Such an application mainly concerns interest rates.
Volume (Year): 4 (2004)
Issue (Month): 6 ()
|Contact details of provider:|| Web page: http://www.tandfonline.com/RQUF20|
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/RQUF20|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Farshid Jamshidian, 1997. "LIBOR and swap market models and measures (*)," Finance and Stochastics, Springer, vol. 1(4), pages 293-330.
- Igor Grubisic & Raoul Pietersz, 2005.
"Efficient Rank Reduction of Correlation Matrices,"
- Grubisic, I. & Pietersz, R., 2005. "Efficient Rank Reduction of Correlation Matrices," ERIM Report Series Research in Management ERS-2005-009-F&A, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Henk Kiers & Patrick Groenen, 1996. "A monotonically convergent algorithm for orthogonal congruence rotation," Psychometrika, Springer;The Psychometric Society, vol. 61(2), pages 375-389, June.
- Miltersen, Kristian R & Sandmann, Klaus & Sondermann, Dieter, 1997. " Closed Form Solutions for Term Structure Derivatives with Log-Normal Interest Rates," Journal of Finance, American Finance Association, vol. 52(1), pages 409-430, March.
- Miltersen, K. & K. Sandmann & D. Sondermann, 1994. "Closed Form Solutions for Term Structure Derivatives with Log-Normal Interest Rates," Discussion Paper Serie B 308, University of Bonn, Germany.
- Alan Brace & Dariusz G¸atarek & Marek Musiela, 1997. "The Market Model of Interest Rate Dynamics," Mathematical Finance, Wiley Blackwell, vol. 7(2), pages 127-155.
- Frank de Jong & Joost Driessen & Antoon Pelsser, 2004. "On the Information in the Interest Rate Term Structure and Option Prices," Review of Derivatives Research, Springer, vol. 7(2), pages 99-127, 08.
- Willard I. Zangwill, 1969. "Convergence Conditions for Nonlinear Programming Algorithms," Management Science, INFORMS, vol. 16(1), pages 1-13, September.
- Kiers, Henk A. L., 2002. "Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems," Computational Statistics & Data Analysis, Elsevier, vol. 41(1), pages 157-170, November. Full references (including those not matched with items on IDEAS)