The Chambolle–Pock method is a versatile three-parameter algorithm designed to solve a broad class of composite convex optimization problems, which encompass two proper, lower semicontinuous, and convex functions, along with a linear operator . The functions are accessed via their proximal operators, while the linear operator is evaluated in a forward manner. Among the three algorithm parameters , , and ; serve as step sizes for the proximal operators, and is an extrapolation step parameter. Previous convergence results have been based on the assumption that . We demonstrate that weak convergence is achievable whenever and . Moreover, we establish tightness of the step size bound by providing an example that is nonconvergent whenever the second bound is violated.

生成讲解博客的中文版本

生成AI智能校验的中文版本