A unified algorithm, blockwise-majorization-descent (BMD), for efficiently computing the solution paths of the group-lasso penalized least squares, logistic regression, Huberized SVM and squared SVM. The package is an implementation of Yang, Y. and Zou, H. (2015) DOI: <doi:10.1007/s11222-014-9498-5>.
copied from cf-staging / r-gglasso
https://anaconda.org/conda-forge/r-gglasso/badges/version.svg
https://anaconda.org/conda-forge/r-gglasso/badges/latest_release_date.svg
https://anaconda.org/conda-forge/r-gglasso/badges/latest_release_relative_date.svg
https://anaconda.org/conda-forge/r-gglasso/badges/platforms.svg
https://anaconda.org/conda-forge/r-gglasso/badges/license.svg
https://anaconda.org/conda-forge/r-gglasso/badges/downloads.svg