New Inertial Proximal Point Algorithms for Solving Common Null Point Problems
Abstract
We investigate the problem of finding a common zero of a finite family of maximal monotone operators in a real Hilbert space. To address this problem, we introduce two new two-step inertial proximal point algorithms and establish their weak convergence. We also derive a best-iterate rate for the squared successive increments. Furthermore, we apply the main results to signal recovery and image restoration problems and compare the proposed schemes with one-step, non-inertial, cyclic, and product-space Douglas–Rachford methods.