Implementation of the block coordinate descent procedure for
solving the proximal function of latent group Lasso, highlighted by
decomposing a DAG into several non-overlapping path graphs, and getting
closed-form solution for each path graph. The procedure was introduced
as Algorithm 4 in Yan and Bien (2017)
|Author||Xiaohan Yan [aut, cre], Jacob Bien [aut, cre]|
|Date of publication||2018-03-22 15:31:13 UTC|
|Maintainer||Xiaohan Yan <[email protected]>|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.