A few years ago, I had taken note that if a convex function $f:\mathbb{R}^n\to\mathbb{R}$ has Lipschitz continuous gradient $\nabla f(x)$ with modulus $L$, then $$\langle \nabla f(x_1) - \nabla f(x_2), x_2 - x_3\rangle \leq \frac{L}{4}||x_1 - x_3||_2^2$$ for any $x_1,x_2,x_3\in\mathbb{R}^n$. How can I prove this inequality? Also, is it possible to obtain a lower bound to the inner product in terms of distance $||x_1 - x_3||_2^2$ if the function is also $m$-strongly convex?
Edit: when $f(x) = \frac{1}{2}||x||^2$, the inequality holds.
After mvkbr's post, I tried to find the book cited by Antipin, but I could not find an English version. Then, I looked at a few other books by Russian scholars and finally found the answer in Section 7.2.1 of Polyak's Introduction to Optimization. I share the proof for completeness.
The proof is based on the co-coercivity of gradient: \begin{align} \langle \nabla f(x_1) - \nabla f(x_2),\ x_3 - x_2\rangle &= \langle \nabla f(x_1) - \nabla f(x_2),\ x_1 - x_2\rangle + \langle \nabla f(x_1) - \nabla f(x_2),\ x_3 - x_1\rangle \\ &\geq \frac{1}{L}||\nabla f(x_1) - \nabla f(x_2||^2 + \langle \nabla f(x_1) - \nabla f(x_2),\ x_3 - x_1\rangle \\ &\geq -\frac{L}{4}||x_3 - x_1||^2 \end{align} where the second inequality follows from the identity $$ ||a||^2 + \langle a,\ b\rangle \geq -\frac{1}{4}||b||^2 \qquad \forall a,b. $$ Negating both sides completes the proof.
If the function is also strongly convex with modulus $m$, then one can also obtain $$ \langle \nabla f(x_1) - \nabla f(x_2),\ x_2 - x_3\rangle \leq \frac{1}{4m}||\nabla f(x_1) - \nabla f(x_3)||^2 $$ using a similar proof technique.