On the finite convergence of a projected cutter method
A mapping \(T\) from a real Hilbert space into itself is said to be a cutter if the set \(\operatorname{Fix}T\) of its fixed points is nonempty and for every \(x\in X\) and \(y\in \operatorname{Fix}T\) one has \(\| Tx-y\| ^{2}+\| x-Tx\| ^{2}\leq \| x-y\| ^{2}\). Assuming that the set \(C\subseteq X\) intersects the interior of \(\operatorname{Fix}T\), a finitely convergent iterative algorithm for finding an element in \(C\cap \operatorname{Fix}T\) is proposed. This algorithm involves a quasi projector of \(C,\) that is, a mapping \(Q:X\to X\) such that \(\operatorname{ran}Q=\operatorname{Fix}Q=C\) and \(\| Qx-c\|\leq \| x-c\|\) for every \(x\in X\) and \(c\in C\). When \(T\) is the resolvent of a maximally monotone operator \(A\), the algorithm finitely converges to an element of \(C\cap A^{-1}0\). Several examples are provided to show that the convergence theorems do not hold true without the assumptions their statements contain on the parameters defining the algorithm.
- scientific article; zbMATH DE number 4016617
- Extrapolation and local acceleration of an iterative process for common fixed point problems
- scientific article; zbMATH DE number 2227334
- On subgradient projectors
- The method for solving the extension of general of the split feasibility problem and fixed point problem of the cutter
- A finitely convergent ``row-action method for the convex feasibility problem
- A finitely convergent algorithm for convex inequalities
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- Convex analysis and monotone operator theory in Hilbert spaces
- Cyclic subgradient projections
- Finding common fixed points of a class of paracontractions
- Finite convergence of a subgradient projections method with expanding controls
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 4016617 (Why is no real title available?)
- scientific article; zbMATH DE number 5777888 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 3288140 (Why is no real title available?)
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Iterative methods for fixed point problems in Hilbert spaces
- Minimization of unsmooth functionals
- Monotone Operators and the Proximal Point Algorithm
- On finitely convergent iterative methods for the convex feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- On subgradient projectors
- Random algorithms for solving convex inequalities
- Reflection-projection method for convex feasibility problems with an obtuse cone
- The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning
- Subgradient projectors: extensions, theory, and characterizations
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- Finitely convergent iterative methods with overrelaxations revisited
- Properties of subgradient projection iteration when applying to linear imaging system
- Convergence in norm of projection regularized Krasnoselski-Mann iterations for fixed points of cutters
- Comparing averaged relaxed cutters and projection methods: theory and examples
- Extrapolation and local acceleration of an iterative process for common fixed point problems
- The method for solving the extension of general of the split feasibility problem and fixed point problem of the cutter
- A finitely convergent circumcenter method for the convex feasibility problem
- New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them
This page was built for publication: On the finite convergence of a projected cutter method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349845)
