Let be a differentiable convex function whose full gradient is -Lipschitz continuous, with . The alternating update first solves the implicit step and then the explicit step:
The implicit step is the proximal operator of , so it exists uniquely. The gradient bound must control the full joint variable; smoothness alone supplies no global constant .
For two updates, let be the difference of their mixed points and the corresponding full gradient difference. The input and output differences are and . The mixed-point norm identity for alternating updates and Baillon–Haddad theorem give
Hence is a -averaged operator for . Its fixed points have both block gradients zero and are exactly the global minimizers of . If a minimizer exists, Browder convergence theorem for averaged operators gives norm convergence of iteration in the stated finite-dimensional setting.
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.
For two mixed points with difference and gradient difference , the input difference is and the output difference is . Their squared-norm difference is . This exact identity is a reusable way to prove averagedness without assuming the two block maps are individually nonexpansive.

Articles by others on the same topic (0)

There are currently no matching articles.