Description Usage Arguments Details Value Note Author(s) See Also Examples
Implementation of the Primal Dual (i.e. Self Dual) Simplex Method on Dantzig selector
1 | dantzig(X, y, lambda = 0.01, nlambda = 50)
|
X |
|
y |
|
lambda |
The parametric simplex method will stop when the calculated parameter is smaller than lambda. The default value is |
nlambda |
This is the number of the maximum path length one would like to achieve. The default length is 50. |
This program applies the parametric simplex linear programming method to the Dantzig selector to solve for the regression coefficient vector. The solution path of the problem corresponds to the parameter in the parametric simplex method.
An object with S3 class "dantzig"
is returned:
X |
|
y |
|
BETA0 |
|
n0 |
|
d0 |
|
validn |
|
lambdalist |
|
The program will stop when either the maximum number of iterations for each column nlambda
is achieved or when the required lambda
is achieved for each column. Note if d is large and nlambda is also large, it is possible that the program will fail to allocate memory for the path.
Haotian Pang, Han Liu, Robert Vanderbei and Di Qi
Maintainer: Haotian Pang<hpang@princeton.edu>
1 2 3 4 5 | #generate data
a = dantzig.generator(n = 200, d = 100, sparsity = 0.1)
#regression coefficient estimation
b = dantzig(a$X0, a$y, lambda = 0.1, nlambda = 100)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.