We compute the solutions for a decreasing sequence of values for λ, starting at the smallest value λmax for which the entire vector β̂ = 0. Apart from giving us a path of solutions, this scheme exploits warm starts, and leads to a more stable algorithm. We have examples where it is faster to compute the path down to λ (for small λ) than the solution only at that value for λ.
