Efficient algorithms for fitting the regularization path of linear or logistic regression models with grouped penalties. This includes group selection methods such as group lasso, group MCP, and group SCAD as well as bi-level selection methods such as the group exponential lasso, the composite MCP, and the group bridge.
https://anaconda.org/kite-eating-tree/r-grpreg/badges/version.svg
https://anaconda.org/kite-eating-tree/r-grpreg/badges/latest_release_date.svg
https://anaconda.org/kite-eating-tree/r-grpreg/badges/latest_release_relative_date.svg
https://anaconda.org/kite-eating-tree/r-grpreg/badges/platforms.svg
https://anaconda.org/kite-eating-tree/r-grpreg/badges/license.svg
https://anaconda.org/kite-eating-tree/r-grpreg/badges/downloads.svg