  We study the L1 minimization problem with additional box constraints. We
motivate the problem with two different views of optimality considerations. We
look into imposing such constraints in projected gradient techniques and
propose a worst case linear time algorithm to perform such projections. We
demonstrate the merits and effectiveness of our algorithms on synthetic as well
as real experiments.
