Statistical inference of semidefinite programming
DOI10.1007/s10107-018-1250-zzbMath1416.62155OpenAlexW2792374469MaRDI QIDQ1739028
Publication date: 24 April 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1250-z
asymptoticssemidefinite programmingcovariance matrixstatistical inferencematrix completion problemnondegeneracyminimum rankminimum trace factor analysis
Asymptotic properties of parametric estimators (62F12) Factor analysis and principal components; correspondence analysis (62H25) Parametric inference under constraints (62F30) Semidefinite programming (90C22)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Singularities of differentiable maps, Volume 1. Classification of critical points, caustics and wave fronts. Transl. from the Russian by Ian Porteous, edited by V. I. Arnol'd
- Statistical inference of minimum rank factor analysis
- Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis
- Weighted minimum trace factor analysis
- Extremal problems on the set of nonnegative definite matrices
- Complementarity and nondegeneracy in semidefinite programming
- First and second order analysis of nonlinear semidefinite programs
- Computational aspects of the greatest lower bound to the reliability and constrained minimum trace factor analysis
- Optimization and dynamical systems
- Exact matrix completion via convex optimization
- Genericity Results in Linear Conic Programming—A Tour d’Horizon
- Rank-Sparsity Incoherence for Matrix Decomposition
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- On Eigenvalue Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Statistical inference of semidefinite programming