The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Computing the nearest correlation matrix--a problem from finance
Abstract
Given a symmetric matrix, what is the nearest correlation matrix—that is, the nearest symmetric positive semidefinite matrix with unit diagonal? This problem arises in the finance industry, where the correlations are between stocks. For distance measured in two weighted Frobenius norms we characterize the solution using convex analysis. We show how the modified alternating projections method can be used to compute the solution for the more commonly used of the weighted Frobenius norms. In the finance application the original matrix has many zero or negative eigenvalues; we show that for a certain class of weights the nearest correlation matrix has correspondingly many zero eigenvalues and that this fact can be exploited in the computation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Optimization by Vector Space Methods
(1970) · Students Quarterly Journal · doi:10.1049/sqj.1970.0088 · Cited by 6,004
Trefethen, L. N., & Bau, III (1997) · doi:10.1137/1.9780898719574 · Cited by 3,301
(2008) · Choice Reviews Online · doi:10.5860/choice.45-5628 · Cited by 2,725
An Algorithm for Restricted Least Squares Regression
Dykstra, R. L. (1983) · Journal of the American Statistical Association · doi:10.1080/01621459.1983.10477029 · Cited by 551
A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces
Boyle, J. P., & Dykstra, R. L. (1986) · Lecture Notes in Statistics · doi:10.1007/978-1-4613-9940-7_3 · Cited by 415
Numerically Stable Generation of Correlation Matrices and Their Factors
Davies, P. I., & Higham, N. J. (2000) · BIT Numerical Mathematics · doi:10.1023/a:1022384216930 · Cited by 117
Self-citation
Cited by
Watkins, M. M., Wiese, D. N., Yuan, D., Boening, C., & Landerer, F. W. (2015) · Journal of Geophysical Research: Solid Earth · doi:10.1002/2014jb011547 · Cited by 1,271
A global synthesis of animal phenological responses to climate change
Cohen, J. M., Lajeunesse, M. J., & Rohr, J. R. (2018) · Nature Climate Change · doi:10.1038/s41558-018-0067-3 · Cited by 550
Designing structured tight frames via an alternating projection method
Tropp, J. A., Dhillon, I. S., Heath, R. W., & Strohmer, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839492 · Cited by 494
Iterative Methods for Fixed Point Problems in Hilbert Spaces
Cegielski, A. (2013) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-30901-4 · Cited by 318
Geraci, M., & Bottai, M. (2014) · Statistics and Computing · doi:10.1007/s11222-013-9381-9 · Cited by 312
Metadata
- Authors
- Higham, N. J.
- Venue
- IMA Journal of Numerical Analysis
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-07-01
- Volume
- 22
- Issue
- 3
- Pages
- 329-343
- ISSN
- 0272-4979 (ISSN-L)
- 1464-3642
- OpenAlex
- W2091560152
- Cited by
- 886
- References
- 8
- FWCI
- 10.24
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.