Riemannian Newton and trust‐region algorithms for analytic rotation in exploratory factor analysis (Q6125851): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q97888145, #quickstatements; #temporary_batch_1714632961156 |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1111/bmsp.12211 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3045916352 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:29, 30 July 2024
scientific article; zbMATH DE number 7831521
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Riemannian Newton and trust‐region algorithms for analytic rotation in exploratory factor analysis |
scientific article; zbMATH DE number 7831521 |
Statements
Riemannian Newton and trust‐region algorithms for analytic rotation in exploratory factor analysis (English)
0 references
12 April 2024
0 references
exploratory factor analysis
0 references
analytic rotation
0 references
Riemannian optimization
0 references
matrix manifold
0 references
truncated Newton algorithm
0 references
trust-region algorithm
0 references
conjugate gradient algorithm
0 references
gradient projection algorithm
0 references
gradient descent algorithm
0 references
