A theoretical study is conducted on the generalized LASSO.
A condition is derived to guarantee the equivalence between the generalized LASSO and LASSO.
An upper bound is given on the complexity of the LARS algorithm.
A closed-form solution of the generalized LASSO is derived for several cases.