Indeed you can not solve the problem ignoring the equality constraints and then project the solution onto the set of solution for the constraint. It is easy to build real world example which shows that.
Yet, it might be that in most cases it will work reasonably well.
You didn't mention how you solve the LASSO Problem but one of the easiest ways to solve it is using Sub Gradient Descent (Though it is not the fastest, but the idea is simple).
The Sub Gradient is a generalization of the Gradient Descent for cases which are not differentiable like the $ {L}_{1} $ Norm.
The Sub Graident of your function above is given by:
$$ s - c + \lambda {\Phi}^{T} \operatorname{sign} \left( \Phi s \right) $$
The nice thing about the Sub Gradient method that it has the Projected Sub Gradient variant which fits exactly what you need.
What you need to do is each iteration of the Sub Gradient Descent to project the result of the step onto the set of the constraint.
It will be something like:
- $ {s}^{ \left( k + \frac{1}{2} \right) } = {s}^{ \left( k \right) } - \alpha \left( {s}^{ \left( k \right) } - c + \lambda {\Phi}^{T} \operatorname{sign} \left( \Phi {s}^{ \left( k \right) } \right) \right) $.
- $ {s}^{ \left( k + 1 \right) } = {s}^{ \left( k + \frac{1}{2} \right) } - {A}^{T} {\left( A {A}^{T} \right)}^{-1} A {s}^{ \left( k + \frac{1}{2} \right) } $.
When you need to iterate between those steps until the solution is converged.
It is easy to see that step (2) is projection onto the convex set defined by $ A s = 0 $.
Of course you can replace the Sub Gradient by something more modern and efficient as FISTA and this will still work like a charm (Iterating by Graidnet Step and Projection Step).
