CONVERGENCE CRITERIA OF GENERALIZED HYBRID PROXIMAL POINT ALGORITHMS
摘要：
Abstract. In this paper, we introduce and analyze some generalized hybrid proximal point algorithms for finding a common element of the set of zeros of a maximal monotone operator and the set of fixed points of a nonexpansive mapping in a Hilbert space. These algorithms include the previously known proximal point algorithms as special cases. Weak and strong convergence of the proposed proximal point algorithms are proved under some mild conditions. Key Words and Phrases: Maximal monotone operator, nonexpansive mapping, zero point, fixed point, proximal point algorithm, resolvent identity, demiclosedness principle, Opial’s property, convergence analysis.
