Description Usage Arguments Value Examples
This function implements a simple block-coordinate descent algorithm to find the maximum of the regularized Gaussiann log-likelihood with a an assymetric penalty of lasso type.
1 2 3 4 5 6 7 8 9 |
S |
the sample covariance matrix |
rho |
positive penalty (can be Inf) |
L |
matrix of lower penalties (can be -Inf) |
U |
matrix of upper penalties (can be Inf) |
tol |
the convergence tolerance (default tol=1e-8) |
pos.constr |
if TRUE (default) penalizes positive K_ij, if FALSE performs the standard dual graphical lasso. |
output |
if TRUE (default) the output will be printed. |
the optimal value of the concentration matrix
the number of iterations the algorithm needed to converge
the corresponding value of the log-likelihood
1 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.