added gaussian.cpp: solve lasso without screening, for research only.
added tests.
biglasso 1.2-3
changed convergence criteria of logistic regression to be the same as that in glmnet.
optimized source code; preparing for CRAN submission.
fixed memory leaks occurred on Windows.
biglasso 1.2-2
added internal data set: the colon cancer data.
biglasso 1.2-1
Implemented another new screening rule (SSR-BEDPP), also combining hybrid strong rule
with a safe rule (BEDPP).
implemented EDPP rule with active set cycling strategy for linear regression.
changed convergence criteria to be the same as that in glmnet.
biglasso 1.1-2
fixed bugs occurred when some features have identical values for different
observations. These features are internally removed from model fitting.
biglasso 1.1-1
Three sparse screening rules (SSR, EDPP, SSR-Dome) were implemented. Our
new proposed HSR-Dome combines HSR and Dome test for feature screening,
leading to even better performance as compared to 'glmnet'.
OpenMP parallel computing was added to speedup single model fitting.
Both exact Newton and majorization-minimization (MM) algorithm for logistic regression
were implemented. The latter could be faster, especially in data-larger-than-RAM cases.
Source code were rewritten in pure cpp.
Sparse matrix representation was added using Armadillo library.