Title
Statistical inference of semidefinite programming
Abstract
In this paper we consider covariance structural models with which we associate semidefinite programming problems. We discuss statistical properties of estimates of the respective optimal value and optimal solutions when the ‘true’ covariance matrix is estimated by its sample counterpart. The analysis is based on perturbation theory of semidefinite programming. As an example we consider asymptotics of the so-called minimum trace factor analysis. We also discuss the minimum rank matrix completion problem and its SDP counterparts.
Year
DOI
Venue
2019
10.1007/s10107-018-1250-z
Mathematical Programming
Keywords
Field
DocType
Semidefinite programming,Minimum trace factor analysis,Matrix completion problem,Minimum rank,Nondegeneracy,Statistical inference,Asymptotics,62F12,62F30,90C22
Rank (linear algebra),Discrete mathematics,Applied mathematics,Perturbation theory,Statistical inference,Covariance matrix,Asymptotic analysis,Mathematics,Semidefinite programming,Covariance
Journal
Volume
Issue
ISSN
174.0
SP1-2
1436-4646
Citations 
PageRank 
References 
1
0.37
6
Authors
1
Name
Order
Citations
PageRank
Alexander Shapiro11273147.62