Efficient Rank Reduction of Correlation Matrices

Details Efficient Rank Reduction of Correlation Matrices Efficient Rank Reduction of Correlation Matrices

2004-03-18

arxiv.org/abs/cond-mat/0403477v2

Physics

Condensed Matter

Other Condensed Matter

First version: 20 pages, 4 figures Second version [changed content]: 21 pages, 6 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Efficient Rank Reduction of Correlation Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Rank Reduction of Correlation Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Rank Reduction of Correlation Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-525057