Opial-Type Theorems and the Common Fixed Point Problem
From MaRDI portal
Publication:2897281
DOI10.1007/978-1-4419-9569-8_9zbMath1245.47019OpenAlexW95296943MaRDI QIDQ2897281
Andrzej Cegielski, Yair Censor
Publication date: 10 July 2012
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-9569-8_9
Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Numerical methods for variational inequalities and related problems (65K15)
Related Items
A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems, Limits of eventual families of sets with application to algorithms for the common fixed point problem, The method for solving the extension of general of the split feasibility problem and fixed point problem of the cutter, A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints, Iterative methods for solving variational inequalities in Euclidean space, Extrapolation and local acceleration of an iterative process for common fixed point problems, The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators, Solving split common fixed-point problem of firmly quasi-nonexpansive mappings without prior knowledge of operators norms, An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space, Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets, Cyclic algorithms for split feasibility problems in Hilbert spaces, Set intersection problems: supporting hyperplanes and quadratic programming, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Convergence in Norm of Projection Regularized Krasnoselski-Mann Iterations for Fixed Points of Cutters, A generalized block-iterative projection method for the common fixed point problem induced by cutters, Viscosity Approximation Methods for Split Common Fixed-Point Problem of Directed Operators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hilbertian convex feasibility problem: Convergence of projection methods
- Relaxed outer projections, weighted averages and convex feasibility
- A linear acceleration row action method for projecting onto subspaces
- Iterative approximation of fixed points
- Convergence results for an accelerated nonlinear Cimmino algorithm
- A parallel subgradient projections method for the convex feasibility problem
- An interior points algorithm for the convex feasibility problem
- Block-iterative surrogate projection methods for convex feasibility problems
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- A general iterative scheme with applications to convex optimization and related fields
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- On the string averaging method for sparse common fixed‐point problems
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Geometrical Look at Iterative Methods for Operators with Fixed Points
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- The method of projections for finding the common point of convex sets
- Several solution methods for the split feasibility problem
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
