Based on Christian Remling's answer, we assume $b-a<1$. We know that $f$ has a pole on $b$. I don't know whether such an $f$ exists but I would at least like to understand the order of growth at this pole.
$f(x)$ is an increasing function. For simplicity of notation let's change variables to $g(x)=f(b-x)$, then $f(x)$ is decreasing. So for any $x$, the $L^p$ norm is at least $g(x) x^{1/p}$. If we plug in $p=(b+1/\log x)$, we get
$g(-1/\log x) \geq g(x) x^{ 1/ (b+ 1/\log x ) } =g(x) x^{1/b- 1/(b \log x) + 1/(b\log x^2) \dots) }= g(x) x^{1/b} e^{1/b + o(1) } $
$g(x) \leq g(-1/\log x) x^{-1/b} e^{1/b + o(1) } $
Let $h(x)= g(1/x)$, then we further simplify:
$h(x) \leq h( \log x) x^{1/b} e^{1/b+o(1)}$
This gives $h(x) \leq (x \cdot \log x \cdot \log \log x \cdot \dots )^{1/b} $
I believe this asymptotic upper bound is fairly sharp, that is, if we have a bound of the form
$h(x) \leq (x \cdot \log x\cdot \log \log x \cdot \dots \log^n x)^{1/b}$
then by taking the $L^p$ norm $n$ times we get a bound of the form $h(x)=O(1)$ and a contradiction, but I haven't checked this.
The method of proof suggests that in the relevant regime, the operator that sends a function $f$ to the set of $L^p$ norms of $f$ is unstable, so iterating it might be a bad idea for finding a fixed point. However, some form of inverse of it might be stable?