On Convergence of Kronecker Graphical Lasso Algorithms
From MaRDI portal
Publication:4578498
DOI10.1109/TSP.2013.2240157zbMath1394.62095arXiv1204.0585OpenAlexW2068943743MaRDI QIDQ4578498
Alfred O. III Hero, Shuheng Zhou, Theodoros Tsiligkaridis
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.0585
Related Items
Kronecker delta method for testing independence between two vectors in high-dimension ⋮ Gaussian and robust Kronecker product covariance estimation: existence and uniqueness ⋮ Robust ground moving target detection for airborne radar using a novel feature-based machine learning approach ⋮ Fast and Separable Estimation in High-Dimensional Tensor Gaussian Graphical Models ⋮ Kronecker-structured covariance models for multiway data ⋮ Hypothesis Testing of Matrix Graph Model with Application to Brain Connectivity Analysis ⋮ Support Recovery and Parameter Identification of Multivariate ARMA Systems with Exogenous Inputs ⋮ Concentration of measure bounds for matrix-variate data with missing values ⋮ Autoregressive identification of Kronecker graphical models ⋮ Graphical model selection and estimation for high dimensional tensor data ⋮ Unnamed Item ⋮ Gemini: graph estimation with matrix variate normal instances ⋮ Toward fast transform learning ⋮ Nonparametric identification of Kronecker networks ⋮ Multilinear Compressive Sensing and an Application to Convolutional Linear Networks
This page was built for publication: On Convergence of Kronecker Graphical Lasso Algorithms
