A new algorithm for the least-squares solution in factor analysis
From MaRDI portal
The method presented in this paper is based on an algorithm developed by the authors [A simple Marquardt algorithm for the nonlinear least-squares problem, Stat. Probab. Lett. 1, 303-307 (1983)] for a general non-linear least squares problems. Numerical experiments are given to show the relative efficiency of the proposed algorithm. The shortcomings of the algorithms are pointed out. The algorithm is based on the Marquardt algorithm for damped least-squares problems.
Recommendations
Cited in
(8)- A Gauss-Newton algorithm for exploratory factor analysis
- Algorithms for unweighted least-squares factor analysis
- An alternating least squares algorithm for PARAFAC2 and three-way DEDICOM
- On the Minres Method of Factor Analysis
- scientific article; zbMATH DE number 1884272 (Why is no real title available?)
- New Characterization of the Factor Refinement Algorithm with Applications
- An efficient algorithm for joint correspondence analysis
- A simple Marquardt algorithm for the nonlinear least-squares problem
This page was built for publication: A new algorithm for the least-squares solution in factor analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789145)