ADMM Algorithm for Graphical Lasso with an ℓ_∞ Element-wise Norm Constraint

11/28/2013
by   Karthik Mohan, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro