Efficient Rank Reduction of Correlation Matrices
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.
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.:
- Qiang Dai & Kenneth Singleton, 2003. "Term Structure Dynamics in Theory and Reality," Review of Financial Studies, Society for Financial Studies, vol. 16(3), pages 631-678, July.
- 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.
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpfi:0502007. 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: (EconWPA)
If references are entirely missing, you can add them using this form.