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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- 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.
- 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-30, March.
- repec:ner:tilbur:urn:nbn:nl:ui:12-3159390 is not listed on IDEAS
- Henk Kiers & Patrick Groenen, 1996. "A monotonically convergent algorithm for orthogonal congruence rotation," Psychometrika, Springer, vol. 61(2), pages 375-389, June.
- Willard I. Zangwill, 1969. "Convergence Conditions for Nonlinear Programming Algorithms," Management Science, INFORMS, vol. 16(1), pages 1-13, September.
- 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.
- 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.
- 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.
- 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.
- Farshid Jamshidian, 1997. "LIBOR and swap market models and measures (*)," Finance and Stochastics, Springer, vol. 1(4), pages 293-330.
When requesting a correction, please mention this item's handle: RePEc:taf:quantf:v:4:y:2004:i:6:p:649-662. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michael McNulty)
If references are entirely missing, you can add them using this form.