Group Lasso Penalized Learning Using a Unified BMD Algorithm

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: .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.5 by Yi Yang, 2 years ago

Report a bug at

Browse source code at

Authors: Yi Yang [aut, cre] ( , Hui Zou [aut] ( , Sahir Bhatnagar [aut] (

Documentation:   PDF Manual  

GPL-2 license

Imports methods

Suggests testthat, knitr, rmarkdown

Imported by FIT, ICBioMark, MLGL, PhylogeneticEM, ecpc, higlasso, sail.

See at CRAN