Approximate solutions of common fixed point problems with infinitely many operators
From MaRDI portal
Publication:6065193
DOI10.3934/jimo.2023097OpenAlexW4385060727MaRDI QIDQ6065193
Publication date: 11 December 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2023097
Fixed-point theorems (47H10) Set-valued operators (47H04) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Cites Work
- Approximate solutions of common fixed-point problems
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Algorithms for solving common fixed point problems
- A note on alternating projections in Hilbert space
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- Projected subgradient minimization versus superiorization
- Iterative methods for generalized split feasibility problems in Hilbert spaces
- Linear Superiorization for Infeasible Linear Programming
- Perturbation resilience and superiorization of iterative algorithms
- Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item