Computing the nearest correlation matrix—a problem from finance
暂无分享,去创建一个
[1] D. Luenberger. Optimization by Vector Space Methods , 1968 .
[2] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[3] R. Dykstra. An Algorithm for Restricted Least Squares Regression , 1983 .
[4] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[5] R. Fletcher. Semi-Definite Matrix Constraints in Optimization , 1985 .
[6] R. Dykstra,et al. A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces , 1986 .
[7] Shih-Ping Han,et al. A successive projection method , 1988, Math. Program..
[8] N. Higham. MATRIX NEARNESS PROBLEMS AND APPLICATIONS , 1989 .
[9] W. Glunt,et al. An alternating projection algorithm for computing the nearest euclidean distance matrix , 1990 .
[10] Frank Deutsch,et al. The Method of Alternating Orthogonal Projections , 1992 .
[11] T. Hayden,et al. Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix , 1993, SIAM J. Matrix Anal. Appl..
[12] S. Poljak,et al. On a positive semidefinite relaxation of the cut polytope , 1995 .
[13] Hein Hundal,et al. The Rate of Convergence for the Method of Alternating Projections, II , 1997 .
[14] L. Trefethen,et al. Numerical linear algebra , 1997 .
[15] Henry Wolkowicz,et al. An Interior-Point Method for Approximate Positive Semidefinite Completions , 1998, Comput. Optim. Appl..
[16] Jos F. Sturm,et al. A Matlab toolbox for optimization over symmetric cones , 1999 .
[17] Philip I. Davies,et al. Numerically Stable Generation of Correlation Matrices and Their Factors , 2000 .