The Chambolle-Pock method, also known as the primal-dual hybrid gradient method, is a standard first-order algorithm for convex-concave saddle-point problems and composite convex optimization involving two proper, lower semicontinuous, convex functions and a bounded linear operator . We study its convergence in real Hilbert spaces for step sizes and relaxation parameter . We prove that, if , then the ergodic duality gap converges at rate , and that, when the inequality is strict, the primal-dual iterates converge weakly to a KKT point. In particular, this extends the weak-convergence theory to the previously unexplored regime . The proof is based on a Lyapunov function that remains uniformly valid over the entire interval .

生成讲解博客的中文版本

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