ADMM Algorithm for Graphical Lasso with an ∞ Element-wise Norm Constraint
Abstract
We consider the problem of Graphical lasso with an additional ∞ element-wise norm constraint on the precision matrix. This problem has applications in high-dimensional covariance decomposition such as in 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.