Approximate solutions for three fixed point problems

Cites Work

Approximate solutions of common fixed-point problems
Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
Algorithms based on unions of nonexpansive maps
Algorithms for solving common fixed point problems
A class of quasi-variational inequalities for adaptive image denoising and decomposition
A note on alternating projections in Hilbert space
On a theorem of Ćirić in \(b\)-metric spaces
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
Approximation of the fixed point of multivalued quasi-nonexpansive mappings via a faster iterative process with applications
Projection algorithms for solving the split feasibility problem with multiple output sets
Projected subgradient minimization versus superiorization
Genericity in nonlinear analysis
Fixed Point Theory in Modular Function Spaces
Outer approximation methods for solving variational inequalities in Hilbert space
Fixed point theory in modular function spaces
A Note on Contractive Mappings
Perturbation resilience and superiorization of iterative algorithms
Algorithms and Convergence Results of Projection Methods for Inconsistent Feasibility Problems: A Review
String-averaging algorithms for convex feasibility with infinitely many sets
Iterative construction of the fixed point of Suzuki's generalized nonexpansive mappings in Banach spaces
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item

This page was built for publication: Approximate solutions for three fixed point problems