An efficient numerical method for condition number constrained covariance matrix approximation
From MaRDI portal
Publication:6347152
DOI10.1016/J.AMC.2020.125925arXiv2008.06851MaRDI QIDQ6347152FDOQ6347152
Authors: Shaoxin Wang 
Publication date: 16 August 2020
Abstract: In the high-dimensional data setting, the sample covariance matrix is singular. In order to get a numerically stable and positive definite modification of the sample covariance matrix in the high-dimensional data setting, in this paper we consider the condition number constrained covariance matrix approximation problem and present its explicit solution with respect to the Frobenius norm. The condition number constraint guarantees the numerical stability and positive definiteness of the approximation form simultaneously. By exploiting the special structure of the data matrix in the high-dimensional data setting, we also propose some new algorithms based on efficient matrix decomposition techniques. Numerical experiments are also given to show the computational efficiency of the proposed algorithms.
Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
This page was built for publication: An efficient numerical method for condition number constrained covariance matrix approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347152)
