# Lasso with linear constraints

I want to efficiently solve the following optimization problem: \begin{align} \min &\quad \left\|\mathbf{x}-\mathbf{x}_0\right\|_2^2 + \lambda\left\|\mathbf{x}\right\|_1\\ \text{Subject to}& \quad A\mathbf{x} \leq c, \end{align}

where $\mathbf{x}\in \mathbb{R}^{n\times 1}$, for big values of $n$. I tried coordinate descend, but it doesn't work. I also don't want to formulate it as QP and use interior-point methods because they are slow. Any idea?

-
Apparently, the problem has been solved recently: Peng Zeng, Yu Zhu, and Tianhong He, Linearly Constrained Lasso with Application in Glioblastoma Data. I haven't read it yet, but it looks like they have designed a LARS type algorithm. –  Taha Jul 31 '12 at 23:26
Also any Lasso algorithm with projecting to constraint set after each iteration also should work. –  mirror2image Aug 1 '12 at 7:42