  The forward-backward splitting technique is a popular method for solving
monotone inclusions that has applications in optimization. In this paper we
explore the behaviour of the algorithm when the inclusion problem has no
solution. We present a new formula to define the normal solutions using the
forward-backward operator. We also provide a formula for the range of the
displacement map of the forward-backward operator. Several examples illustrate
our theory.
