首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Structure methods for solving the nearest correlation matrix problem
Authors:Suliman Al-Homidan  Munirah AlQarni
Institution:1. Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, P.O. Box 119, Dhahran, 31261, Saudi Arabia
2. Department of Mathematics, Dammam Girls College, P.O. Box 30903, Al khobar, 31952, Saudi Arabia
Abstract:The nearest correlation matrix problem is to find a positive semidefinite matrix with unit diagonal, that is, nearest in the Frobenius norm to a given symmetric matrix A. This problem arises in the finance industry, where the correlations are between stocks. In this paper, we formulate this problem as a smooth unconstrained minimization problem, for which rapid convergence can be obtained. Other methods are also studied. Comparative numerical results are reported.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号