ADMM Algorithm for Graphical Lasso with an ℓ∞\ell_{\infty} Element-wise Norm Constraint

preprint2013arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.