sglOptim: Sparse group lasso generic optimizer
Version 1.1.137.0

Fast generic solver for sparse group lasso optimization problems. The loss (objective) function must be defined in a C++ module. This package apply template metaprogramming techniques, therefore -- when compiling the package from source -- a high level of optimization is needed to gain full speed (e.g. for the GCC compiler use -O3). Use of multiple processors for cross validation and subsampling is supported through OpenMP. The Armadillo C++ library is used as the primary linear algebra engine. (The sglOptim package version a.b.c.d is interpreted as follows: a - primary version, b - major updates and fixes, c - source revision as corresponding to R-Forge, d - minor fixes made only to the CRAN branch of the source)

Getting started

Package details

AuthorMartin Vincent
Date of publication2015-04-07 09:49:13
MaintainerMartin Vincent <vincent@math.ku.dk>
LicenseGPL (>= 2)
Version1.1.137.0
URL http://dx.doi.org/10.1016/j.csda.2013.06.004
Package repositoryView on R-Forge
Installation Install the latest version of this package by entering the following in R:
install.packages("sglOptim", repos="http://R-Forge.R-project.org")

Try the sglOptim package in your browser

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

sglOptim documentation built on May 31, 2017, 4:19 a.m.