摘要

We desire to find a correlation matrix (R) over cap of a given rank that is as close as possible to an input matrix R, subject to the constraint that specified elements in (R) over cap must be zero. Our optimality criterion is the weighted Frobenius norm of the approximation error, and we use a constrained majorization algorithm to solve the problem. Although many correlation matrix approximation approaches have been proposed, this specific problem, with the rank specification and the (R) over cap (ij) = 0 constraints, has not been studied until now. We discuss solution feasibility, convergence, and computational effort. We also present several examples.

  • 出版日期2010-2-15