sglOptim (1.3.8)

0 users

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.

Maintainer: Niels Richard Hansen
Author(s): Martin Vincent [aut], Niels Richard Hansen [ctb, cre]

License: GPL (>= 2)

Uses: doParallel, foreach, Matrix, knitr, rmarkdown
Reverse depends: lsgl, msgl

Released 11 months ago.

7 previous versions



  (0 votes)


  (0 votes)

Log in to vote.


No one has written a review of sglOptim yet. Want to be the first? Write one now.

Related packages:(20 best matches, based on common tags.)

Search for sglOptim on google, google scholar, r-help, r-devel.

Visit sglOptim on R Graphical Manual.