The following pages link to (Q4801805):
Displaying 13 items.
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- Subgradient projection algorithms and approximate solutions of convex feasibility problems (Q364738) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (Q741092) (← links)
- Projection and proximal point methods: Convergence results and counterexamples. (Q1426419) (← links)
- Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases (Q2138440) (← links)
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods (Q2346394) (← links)
- On the string averaging method for sparse common fixed‐point problems (Q3563615) (← links)
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections (Q3563617) (← links)
- Linear convergence rates for extrapolated fixed point algorithms (Q4613991) (← links)
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems (Q4653550) (← links)
- Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications (Q6110101) (← links)