SglOptimizer: Sparse group lasso optimizer
Version 0.0.80

Fast algorithm for solving the sparse group lasso convex optimization problem. 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. Armadillo is licensed under the MPL 2.0. The Armadillo C++ library is primarily developed at NICTA (Australia) by Conrad Sanderson, with contributions from around the world. Furthermore the package utilize various Boost libraries, in particular the Tuple library by Jaakko Jarvi and the Random library by Jens Maurer. The Boost libraries are licensed under the Boost Software License.

Getting started

Package details

AuthorMartin Vincent
Date of publication2013-06-27 07:39:31
MaintainerMartin Vincent <vincent@math.ku.dk>
LicenseGPL (>= 2)
Version0.0.80
URL http://arxiv.org/abs/1205.1245 http://arma.sourceforge.net/ http://www.boost.org/
Package repositoryView on R-Forge
Installation Install the latest version of this package by entering the following in R:
install.packages("SglOptimizer", repos="http://R-Forge.R-project.org")

Try the SglOptimizer package in your browser

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

SglOptimizer documentation built on May 31, 2017, 3:04 a.m.