Hostname: page-component-745bb68f8f-d8cs5 Total loading time: 0 Render date: 2025-01-07T18:26:33.242Z Has data issue: false hasContentIssue false
  • English
  • Français

A Newton-Raphson Algorithm for Maximum Likelihood Factor Analysis

Published online by Cambridge University Press:  01 January 2025

Robert I. Jennrich  and
Stephen M. Robinson
Robert I. Jennrich
Affiliation:
University of California, Los Angeles United States Army
Stephen M. Robinson
Affiliation:
University of California, Los Angeles United States Army
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper demonstrates the feasibility of using a Newton-Raphson algorithm to solve the likelihood equations which arise in maximum likelihood factor analysis. The algorithm leads to clean easily identifiable convergence and provides a means of verifying that the solution obtained is at least a local maximum of the likelihood function. It is shown that a popular iteration algorithm is numerically unstable under conditions which are encountered in practice and that, as a result, inaccurate solutions have been presented in the literature. The key result is a computationally feasible formula for the second differential of a partially maximized form of the likelihood function. In addition to implementing the Newton-Raphson algorithm, this formula provides a means for estimating the asymptotic variances and covariances of the maximum likelihood estimators.

Type
Original Paper
Information
Psychometrika , Volume 34 , Issue 1 , March 1969 , pp. 111 - 123
Copyright
Copyright © 1969 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

*

This research was supported by the Air Force Office of Scientific Research, Grant No. AF-AFOSR-4.59-66 and by National Institutes of Health, Grant No. FR-3.

References

Anderson, T. W., & Rubin, H. Statistical inference in factor analysis. Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, 1956, 5, 111–149Google Scholar
Fletcher, R., & Powell, M. J. D. A rapidly convergent descent method for minimization. Computer Journal, 1963, 6, 163–168CrossRefGoogle Scholar
Harman, H. H. Modern factor analysis. Univ. of Chicago Press, 1960.Google Scholar
Henrici, P. Elements of numerical analysis, 1964, New York: WileyGoogle Scholar
Jennrich, R. I., & Sampson, P. F. Application of stepwise regression to non-linear estimation. Technometrics, 1968, 10, 63–72CrossRefGoogle Scholar
Jöreskog, K. G. Some contributions to maximum likelihood factor analysis. Psychometrika, 1967, 32, 443–482CrossRefGoogle Scholar
Lawley, D. N. The estimation of factor loadings by the method of maximum likelihood. Proceedings of the Royal Society of Edinburgh, 1940, 60, 64–82CrossRefGoogle Scholar
Rao, C. R. Estimation and tests of significance in factor analysis. Psychometrika, 1955, 20, 93–111CrossRefGoogle Scholar