Computation of the maximum likelihood estimator in low-rank factor analysis
DOI10.1007/S10107-019-01370-7zbMATH Open1415.90074arXiv1801.05935OpenAlexW2964108664WikidataQ128287820 ScholiaQ128287820MaRDI QIDQ2425172FDOQ2425172
Koulik Khamaru, Rahul Mazumder
Publication date: 26 June 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.05935
sparsitysemidefinite optimizationdifference of convex optimizationspectral functionsmaximum likelihood factor analysislow-rank constraint
Factor analysis and principal components; correspondence analysis (62H25) Convex programming (90C25) Nonlinear programming (90C30) Semidefinite programming (90C22) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Latent Variable Models and Factor Analysis
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Variational Analysis
- The Concave-Convex Procedure
- Sparse inverse covariance estimation with the graphical lasso
- Statistical analysis of factor models of high dimension
- EM algorithms for ML factor analysis
- Some contributions to maximum likelihood factor analysis
- Fast low-rank modifications of the thin singular value decomposition
- Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting
- Maximum likelihood factor analysis with rank-deficient sample covariance matrices
- Derivatives of Spectral Functions
- Convex analysis and nonlinear optimization. Theory and examples.
- Convex Analysis on the Hermitian Matrices
- Statistical inference of minimum rank factor analysis
- All convex invariant functions of hermitian matrices
- Computing B-Stationary Points of Nonsmooth DC Programs
- On the pervasiveness of difference-convexity in optimization and statistics
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- Certifiably Optimal Low Rank Factor Analysis
Cited In (3)
Uses Software
This page was built for publication: Computation of the maximum likelihood estimator in low-rank factor analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425172)