General-type proximal point algorithm for solving inclusion and fixed point problems with composite operators (Q2184225)

The author introduces a new general-type proximal point algorithm for finding a common element of the set of solutions of a monotone inclusion problem, the set of minimizers of a convex function, and the set of solutions of a fixed point problem with composite operators, i.e., the composition of quasi-nonexpansive and firmly nonexpansive mappings in real Hilbert spaces, and then proves that the sequence \(x_n\) which is generated by the newly introduced iterative algorithm converges strongly to a common element of the three sets above without a commutation assumption on the mappings. The established result generalizes some well-known results in the literature. Alas, we noticed some misleading lines (or inequalities) in the proof of the main theorem.