.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
The correlation matrix has a wide range of applications in finance and risk management. However, due to the constraints of practical operations, the correlation matrix cannot satisfy the positive semidefinite property in most cases. In this paper, an elementwisely alternative gradient algorithm and a columnwisely alternative gradient algorithm are presented to compute the nearest correlation matrix that satisfies the semidefinite property for a given set of constraints. The convergence properties and the implementation of these two algorithms are discussed. Numerical experiments show that the proposed methods are efficient. Furthermore, the columnwisely alternative gradient algorithm outperforms other algorithms in terms of the number of iterations and the objective value of the cost function. (C) 2013 Elsevier Inc. All rights reserved.
Keyword:
Alternative gradient algorithm
Matrix factorization and approximation
Nearest correlation matrix
Positive semidefinite matrix
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.4W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容