✦ LIBER ✦

A gauss-newton algorithm for exploratory factor analysis

✍ Scribed by Robert I. Jennrich

Book ID: 112726618
Publisher: Springer
Year: 1986
Tongue: English
Weight: 458 KB
Volume: 51
Category: Article
ISSN: 0033-3123
DOI: 10.1007/bf02293985

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Newton-Raphson algorithm for maximum l

A Newton-Raphson algorithm for maximum likelihood factor analysis

✍ Robert I. Jennrich; Stephen M. Robinson 📂 Article 📅 1969 🏛 Springer 🌐 English ⚖ 619 KB

A local convergence analysis for the Gau

A local convergence analysis for the Gauss-Newton and Levenberg-Morrison-Marquardt Algorithms

✍ W. M. Häußler 📂 Article 📅 1983 🏛 Springer Vienna 🌐 English ⚖ 639 KB

Accelerated Gauss-Newton algorithms for

Accelerated Gauss-Newton algorithms for nonlinear least squares problems

✍ Axel Ruhe 📂 Article 📅 1979 🏛 Springer Netherlands 🌐 English ⚖ 609 KB

A Damped Gauss-Newton Method for

✍ Shaohua Pan; Jein-Shan Chen 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 542 KB

A hybrid EM/Gauss-Newton algorithm for m

A hybrid EM/Gauss-Newton algorithm for maximum likelihood in mixture distributions

✍ Murray Aitkin; Irit Aitkin 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 344 KB

A faster alternative to the EM algorithm in finite mixture distributions is described, which alternates EM iterations with Gauss Newton iterations using the observed information matrix. At the expense of modest additional analytical effort in obtaining the observed information, the hybrid algorithm

A Kantorovich-type convergence analysis

A Kantorovich-type convergence analysis for the Gauss-Newton-Method

✍ W. M. Häußler 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 311 KB