A generalized block-iterative projection method for the common fixed point problem induced by cutters
From MaRDI portal
Publication:2089887
DOI10.1007/s10898-022-01175-7OpenAlexW4281732457MaRDI QIDQ2089887
Daniel Reem, Yair Censor, Maroun Zaknoon
Publication date: 24 October 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.09770
Sensitivity, stability, well-posedness (49K40) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59) Fixed-point theorems (47H10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Iterative methods for fixed point problems in Hilbert spaces
- Convex feasibility modeling and projection methods for sparse signal recovery
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Finite convergence of a subgradient projections method with expanding controls
- A generalized projection-based scheme for solving convex constrained optimization problems
- Relaxed outer projections, weighted averages and convex feasibility
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- On the finite convergence of a projected cutter method
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization
- Opial-Type Theorems and the Common Fixed Point Problem
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Block Iterative Methods for a Finite Family of Generalized Nonexpansive Mappings in Banach Spaces
- On the string averaging method for sparse common fixed‐point problems
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
- Perturbation resilience and superiorization of iterative algorithms
- On Diagonally Relaxed Orthogonal Projection Methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- Superiorization for Image Analysis
- On Subgradient Projectors
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A generalized block-iterative projection method for the common fixed point problem induced by cutters
