Package: L0Learn
Type: Package
Title: Fast Algorithms for Best Subset Selection
Version: 1.2.0
Date: 2019-08-30
Author: Hussein Hazimeh, Rahul Mazumder
Maintainer: Hussein Hazimeh <hazimeh@mit.edu>
Description: Highly optimized toolkit for approximately solving L0-regularized learning problems (aka best subset selection).
    The algorithms are based on coordinate descent and local combinatorial search.
    For more details, check the paper by Hazimeh and Mazumder (2018) <arXiv:1803.01454>;
    the link is provided in the URL field below.
URL: https://arxiv.org/abs/1803.01454
License: MIT + file LICENSE
Depends: R (>= 3.3.0)
Imports: Rcpp (>= 0.12.13), Matrix, methods, ggplot2, reshape2
LinkingTo: Rcpp, RcppArmadillo
RoxygenNote: 6.1.1
Suggests: knitr, rmarkdown
VignetteBuilder: knitr
NeedsCompilation: yes
Packaged: 2019-08-30 14:29:43 UTC; hh
Repository: CRAN
Date/Publication: 2019-08-30 15:00:02 UTC
Built: R 3.5.2; x86_64-apple-darwin15.6.0; 2019-08-31 05:24:18 UTC; unix
Archs: L0Learn.so.dSYM
