A RAPIDLY CONVERGENT METHOD FOR MAXIMUM‐LIKELIHOOD FACTOR ANALYSIS
From MaRDI portal
Publication:5605065
Cited in
(16)- Canonical analysis of longitudinal and repeated measures data with stationary weights
- A Gauss-Newton algorithm for exploratory factor analysis
- The stability of voter perceptions: A comparison of candidate positions across time using the spatial theory of voting
- Bayesian estimation in unrestricted factor analysis: A treatment for Heywood cases
- A class of factor analysis estimation procedures with common asymptotic sampling properties
- On Bayesian estimation in unrestricted factor analysis
- Estimation of an oblique structure via penalized likelihood factor analysis
- Standard errors for obliquely rotated factor loadings
- Application of the bootstrap methods in factor analysis
- Stepwise variable selection in factor analysis
- Factor analysis by generalized least squares
- Sparse estimation via nonconcave penalized likelihood in factor analysis model
- Variable selection via the weighted group Lasso for factor analysis models
- Factor-analysis estimation of simultaneity-error models
- A General Computing Algorithm for Factor Analysis
- A New Method for Statistical Multidimensional Unfolding
This page was built for publication: A RAPIDLY CONVERGENT METHOD FOR MAXIMUM‐LIKELIHOOD FACTOR ANALYSIS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5605065)