Positive-definite _1-penalized estimation of large covariance matrices
From MaRDI portal
Publication:4904725
Abstract: The thresholding covariance estimator has nice asymptotic properties for estimating sparse large covariance matrices, but it often has negative eigenvalues when used in real data analysis. To simultaneously achieve sparsity and positive definiteness, we develop a positive definite -penalized covariance estimator for estimating sparse large covariance matrices. An efficient alternating direction method is derived to solve the challenging optimization problem and its convergence properties are established. Under weak regularity conditions, non-asymptotic statistical theory is also established for the proposed estimator. The competitive finite-sample performance of our proposal is demonstrated by both simulation and real applications.
Recommendations
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 4062374 (Why is no real title available?)
- A generalized approach to portfolio optimization: improving performance by constraining portfolio norms
- Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
- Adaptive thresholding for sparse covariance matrix estimation
- Are a set of microarrays independent of each other?
- Covariance regularization by thresholding
- DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Estimation of high-dimensional prior and posterior covariance matrices in Kalman filter vari\-ants
- First-Order Methods for Sparse Covariance Selection
- Generalized thresholding of large covariance matrices
- High-dimensionality effects in the Markowitz problem and other quadratic programs with linear constraints: risk underestimation
- Large-scale inference. Empirical Bayes methods for estimation, testing, and prediction
- Nonparametric estimation of large covariance matrices of longitudinal data
- On the distribution of the largest eigenvalue in principal components analysis
- Operator norm consistent estimation of large-dimensional sparse covariance matrices
- Optimal rates of convergence for covariance matrix estimation
- Positive definite estimators of large covariance matrices
- Regularized estimation of large covariance matrices
- Sparse and stable Markowitz portfolios
- Sparse inverse covariance estimation with the graphical lasso
- The Adaptive Lasso and Its Oracle Properties
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Vast portfolio selection with gross-exposure constraints
Cited in
(64)- High-performance statistical computing in the computing environments of the 2020s
- Tuning-parameter selection in regularized estimations of large covariance matrices
- HIGHER-ORDER ACCURATE, POSITIVE SEMIDEFINITE ESTIMATION OF LARGE-SAMPLE COVARIANCE AND SPECTRAL DENSITY MATRICES
- Retaining positive definiteness in thresholded matrices
- Estimation of graphical models through structured norm minimization
- Diagonally Dominant Principal Component Analysis
- Weighted covariance matrix estimation
- Ensemble sparse estimation of covariance structure for exploring genetic disease data
- Positive definite estimators of large covariance matrices
- Correlation structure selection for longitudinal data with diverging cluster size
- Estimation and optimal structure selection of high-dimensional Toeplitz covariance matrix
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach
- Double shrinkage estimators for large sparse covariance matrices
- Positive-definite thresholding estimators of covariance matrices with zeros
- Estimation of a sparse and spiked covariance matrix
- Positive semidefiniteness of estimated covariance matrices in linear models for sample survey data
- Regularization for high-dimensional covariance matrix
- On variable ordination of Cholesky‐based estimation for a sparse covariance matrix
- On the penalized maximum likelihood estimation of high-dimensional approximate factor model
- Gaussian Patch Mixture Model Guided Low-Rank Covariance Matrix Minimization for Image Denoising
- Spatial disease mapping using directed acyclic graph auto-regressive (DAGAR) models
- Adaptive estimation of the copula correlation matrix for semiparametric elliptical copulas
- Sparse minimum discrepancy approach to sufficient dimension reduction with simultaneous variable selection in ultrahigh dimension
- A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices
- An implementable first-order primal-dual algorithm for structured convex optimization
- A graphical model selection tool for mixed models
- High dimensional covariance matrix estimation by penalizing the matrix-logarithm transformed likelihood
- On the existence of positive-definite maximum-likelihood estimates of structured covariance matrices
- Fixed support positive-definite modification of covariance matrix estimators via linear shrinkage
- Conditioning theory of the equality constrained quadratic programming and its applications
- Sharp optimality for high-dimensional covariance testing under sparse signals
- Sparse and low-rank covariance matrix estimation
- A sequential test for variable selection in high dimensional complex data
- Cholesky-based model averaging for covariance matrix estimation
- Efficient estimation of approximate factor models via penalized maximum likelihood
- Lassoing eigenvalues
- Fourier transform sparse inverse regression estimators for sufficient variable selection
- Some statistical problems with high dimensional financial data
- High-dimensional Markowitz portfolio optimization problem: empirical comparison of covariance matrix estimators
- An efficient numerical method for condition number constrained covariance matrix approximation
- An improved banded estimation for large covariance matrix
- Positive-definite modification of a covariance matrix by minimizing the matrix \(\ell_{\infty}\) norm with applications to portfolio optimization
- Sparse covariance matrix estimation by DCA-based algorithms
- A Compound Decision Approach to Covariance Matrix Estimation
- A Cholesky-based estimation for large-dimensional covariance matrices
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Sparse estimation of high-dimensional correlation matrices
- Covariance estimation via sparse Kronecker structures
- D-trace estimation of a precision matrix using adaptive lasso penalties
- Graph-guided banding of the covariance matrix
- Alternating proximal gradient method for convex minimization
- A multiple testing approach to the regularisation of large sample correlation matrices
- Power enhancement for testing multi-factor asset pricing models via Fisher's method
- Semi-parametric inference for large-scale data with temporally dependent noise
- The minimum covariance determinant estimator for interval-valued data
- Direct covariance matrix estimation with compositional data
- Ridge estimation of covariance matrix from data in two classes.
- High-dimensional covariance matrix estimation
- Estimation of sparse covariance matrix via non-convex regularization
- Nonasymptotic support recovery for high-dimensional sparse covariance matrices
- Testing and signal identification for two-sample high-dimensional covariances via multi-level thresholding
- ADMM for High-Dimensional Sparse Penalized Quantile Regression
- Robust Covariance Matrix Estimation for High-Dimensional Compositional Data with Application to Sales Data Analysis
- Robust Shape Matrix Estimation for High-Dimensional Compositional Data with Application to Microbial Inter-Taxa Analysis
This page was built for publication: Positive-definite \(\ell_1\)-penalized estimation of large covariance matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904725)
