Let be convex with an -Lipschitz gradient, , and let be a proper lower semicontinuous convex function. For , take
The proper closed convex assumption on ensures that the implicit section has a well-defined proximal operator.
For two mixed points with difference , write for the gradient difference of and for the difference of the selected subgradients of . Inputs differ by and outputs by . Monotonicity of a convex subdifferential gives , while cocoercivity gives . Expanding these squared norms proves
for . Thus the combined update is firmly nonexpansive. Its fixed points are the minimizers of ; if one exists, the Browder convergence theorem for averaged operators gives norm convergence in finite dimensions.
Here -smooth means that is differentiable on the entire Euclidean space and has an -Lipschitz gradient, with . Together with convexity, this implies -cocoercivity:
First, integration of the Lipschitz gradient along a line segment proves the descent lemma:
Indeed, subtract the linear term and integrate for ; its absolute value is at most .
Fix and define . This is a convex function, has the same Lipschitz gradient constant, and , so is a global minimizer. Put . The descent lemma at with gives
Therefore
Interchange and add the inequalities. The function values cancel, leaving the asserted cocoercivity. This is a proof of the Baillon–Haddad theorem without assuming a second derivative. Convexity is essential: has a -Lipschitz gradient but its gradient is not cocoercive.
Assume , as is necessary for convergence to a minimizer. The printed hypotheses alone omit this condition: in scalar is convex with an -Lipschitz gradient for any prescribed , but has no minimizer, and the update sends to .
Under existence, define the full update . The proximal -step is uniquely defined by strong convexity of its quadratic term and satisfies
The partial subdifferential in this equation belongs to the scalar function ; differentiating a subdifferential itself would not define the printed proximal minimization.
We prove directly that the alternating proximal-gradient operator is averaged. For two inputs and , set
The input difference is , the output difference is , and the difference of the two update residuals is . Exact expansion gives
The first inequality uses cocoercivity at the mixed points . Therefore is -averaged for the requested . In particular, the endpoint is covered: is firmly nonexpansive, not merely nonexpansive.
A fixed point has and , so the two optimality equations give and . Conversely, at a minimizer both gradients vanish and neither step moves. By convexity,
The assumed existence of a minimizer supplies a fixed point. The Browder convergence theorem for averaged operators now gives
No uniqueness of the minimizer is needed. The same estimate even proves averagedness for in this smooth setting, but the requested interval already suffices. The existence condition and the use of the gradient at are both essential to the proof as presented.