pith. sign in

arxiv: 1311.7198 · v1 · pith:MJSDFNTYnew · submitted 2013-11-28 · 💻 cs.LG · math.OC· stat.ML

ADMM Algorithm for Graphical Lasso with an ell_(infty) Element-wise Norm Constraint

classification 💻 cs.LG math.OCstat.ML
keywords algorithmproblemadmmconstraintelement-wisegraphicalinftylasso
0
0 comments X
read the original abstract

We consider the problem of Graphical lasso with an additional $\ell_{\infty}$ element-wise norm constraint on the precision matrix. This problem has applications in high-dimensional covariance decomposition such as in \citep{Janzamin-12}. We propose an ADMM algorithm to solve this problem. We also use a continuation strategy on the penalty parameter to have a fast implemenation of the algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.