A real-time iterative projection scheme for solving the common fixed point problem and its applications

DOI10.1007/s10958-022-06030-4OpenAlexW4289130307MaRDI QIDQ2168968

Aviv Gibali, D. Teller

Publication date: 29 August 2022

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-022-06030-4

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48)

Uses Software

• AIR tools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
• Iterative methods for fixed point problems in Hilbert spaces
• Subsequent convergence of iterative methods with applications to real-time model-predictive control
• Randomized Kaczmarz solver for noisy linear systems
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• A cyclic Douglas-Rachford iteration scheme
• AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
• On the Mann-type iteration and the convex feasibility problem
• Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
• Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
• Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
• On Projection Algorithms for Solving Convex Feasibility Problems
• Iterative projection onto convex sets using multiple Bregman distances
• Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators
• Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities
• FIXED-POINT THEOREMS FOR NONCOMPACT MAPPINGS IN HILBERT SPACE
• Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• The method of projections for finding the common point of convex sets
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: A real-time iterative projection scheme for solving the common fixed point problem and its applications