T-class algorithms for pseudocontractions and -strict pseudocontractions in Hilbert spaces

Abstract

In this paper we study iterative algorithms for finding a common element of the set of fixed points of -strict pseudocontractions or finding a solution of a variational inequality problem for a monotone, Lipschitz continuous mapping. The last problem being related to finding fixed points of pseudocontractions. These algorithms were already studied in [G.L. Acedo, H.-K. Xu] and [N. Nadezhkina, W. Takahashi] but our aim here is to provide the links between these know algorithms and the general framework of T-class algorithms studied in [H.H. Bauschke, P.L. Combettes].

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…