Generic Sparse Group Lasso Solver

Fast generic solver for sparse group lasso optimization problems. The loss (objective) function must be defined in a C++ module. The optimization problem is solved using a coordinate gradient descent algorithm. Convergence of the algorithm is established (see reference) and the algorithm is applicable to a broad class of loss functions. Use of parallel computing for cross validation and subsampling is supported through the 'foreach' and 'doParallel' packages. Development version is on GitHub, please report package issues on GitHub.


News

Reference manual

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

install.packages("sglOptim")

1.3.8 by Niels Richard Hansen, 2 months ago


https://dx.doi.org/10.1016/j.csda.2013.06.004, https://github.com/nielsrhansen/sglOptim


Report a bug at https://github.com/nielsrhansen/sglOptim/issues


Browse source code at https://github.com/cran/sglOptim


Authors: Martin Vincent [aut] , Niels Richard Hansen [ctb, cre]


Documentation:   PDF Manual  


GPL (>= 2) license


Imports methods, stats, tools, utils

Depends on Matrix, foreach, doParallel

Suggests knitr, rmarkdown

Linking to Rcpp, RcppProgress, RcppArmadillo, BH


Depended on by msgl.


See at CRAN