Computational aspects of the greatest lower bound to the reliability and constrained minimum trace factor analysis
From MaRDI portal
Publication:1837502
DOI10.1007/BF02293900zbMath0507.62055MaRDI QIDQ1837502
Jos M. F. ten Berge, Tom A. B. Snijders, Frits E. Zegers
Publication date: 1981
Published in: Psychometrika (Search for Journal in Brave)
reliability; positive semidefinite; internal consistency; Gramian matrix; minimal trace; computational aspects; greatest lower bound; Heywood case; communality; constrained minimum trace factor analysis
62H25: Factor analysis and principal components; correspondence analysis
15A99: Basic linear algebra
15A21: Canonical forms, reductions, classification
62P15: Applications of statistics to psychology
Related Items
A numerical approach to the approximate and the exact minimum rank of a covariance matrix, Minimum rank and minimum trace of covariance matrices, Extremal problems on the set of nonnegative definite matrices, Reliability of test scores in nonparametric item response theory, On the gap between the quadratic integer programming problem and its semidefinite relaxation, A measure of independence for a multivariate normal distribution and some connections with factor analysis, Internal consistency of tests: Analyses old and new, A quasi-newton method for minimum trace factor analysis
Cites Work