sglOptim: Generic Sparse Group Lasso Solver
Version 1.3.6

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.

Getting started

Package details

AuthorMartin Vincent
Date of publication2017-04-02 17:41:19 UTC
MaintainerMartin Vincent <martin.vincent.dk@gmail.com>
LicenseGPL (>= 2)
Version1.3.6
URL https://dx.doi.org/10.1016/j.csda.2013.06.004 https://github.com/vincent-dk/sglOptim
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("sglOptim")

Try the sglOptim package in your browser

Any scripts or data that you put into this service are public.

sglOptim documentation built on May 30, 2017, 7:02 a.m.