The following pages link to (Q2768013):
Displayed 34 items.
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- Compositions and convex combinations of averaged nonexpansive operators (Q486536) (← links)
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations (Q679708) (← 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)
- A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates (Q1744044) (← links)
- Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy (Q2020314) (← links)
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning (Q2101916) (← links)
- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases (Q2138440) (← links)
- A real-time iterative projection scheme for solving the common fixed point problem and its applications (Q2168968) (← links)
- Projected subgradient minimization versus superiorization (Q2251567) (← links)
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods (Q2346394) (← links)
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems (Q2423796) (← links)
- Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT) (Q2437932) (← links)
- Parallelization of reconstruction algorithms in three-dimensional electron microscopy (Q2504456) (← links)
- CADD: a seamless solution to the domain decomposition problem of subdomain boundaries and cross-points (Q2659698) (← links)
- New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses (Q2789608) (← links)
- Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings (Q2946212) (← links)
- Linear convergence rates for extrapolated fixed point algorithms (Q4613991) (← links)
- String-averaging incremental stochastic subgradient algorithms (Q4631774) (← links)
- Nesterov perturbations and projection methods applied to IMRT (Q4959911) (← links)
- Stochastic block projection algorithms with extrapolation for convex feasibility problems (Q5058397) (← links)
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators (Q5346621) (← links)
- Total variation superiorization in dual-energy CT reconstruction for proton therapy treatment planning (Q5346633) (← links)
- String-averaging algorithms for convex feasibility with infinitely many sets (Q5382471) (← links)
- XCT image reconstruction by a modified superiorized iteration and theoretical analysis (Q5858996) (← links)
- Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms (Q5955128) (← links)
- Convergence of the Cimmino algorithm for common fixed point problems with a countable family of operators (Q6059002) (← links)
- Approximate solutions of common fixed point problems with infinitely many operators (Q6065193) (← links)
- Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications (Q6110101) (← links)
- (Q6188236) (← links)