A Note on the General Solution to Completing Partially Specified Correlation Matrices. Issue 2 (3rd April 2021)

• Record Type: Journal Article
• Authors: Olvera Astivia, Oscar L.
• Is Part Of: Measurement. Volume 19:Issue 2(2021)
• Page Start: 115
• Page End: 123
• Publication Date: 2021-04-03
• Subjects: Semidefinite programming -- missing correlation -- positive definiteness -- covariance matrix; Social sciences -- Methodology -- Periodicals; Social sciences -- Statistical methods -- Periodicals; Social sciences -- Mathematical models -- Periodicals; Measurement -- Periodicals; 300.72
• DOI: 10.1080/15366367.2020.1827883
• Languages: English
• ISSNs: 1536-6367

Abstract

ABSTRACT: Partially specified correlation matrices (not to be confused with matrices with missing data or EM-correlation matrices) can appear in research settings such as integrative data analyses, quantitative systematic reviews or whenever the study design only allows for the collection of certain variables. Although approaches to fill in these missing entries have been considered for special cases of low-dimensional matrices, a general approach that can handle correlation matrices of arbitrary size and number of missing entries is needed. The present article relies on the theory of convex optimization and semidefinite programming to derive a semidefinite program that can offer researchers a mathematically principled approach to fill in the missing entries. An easy-to-use function in the R programming language is also presented that implements the theory derived herein.