Pages that link to "Item:Q1822907"
From MaRDI portal
The following pages link to Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907):
Displaying 50 items.
- Convergence theorems of convex combination methods for treating \(d\)-accretive mappings in a Banach space and nonlinear equation (Q261778) (← links)
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- A convergence result on random products of mappings in metric spaces (Q368395) (← links)
- A convergence result on random products of mappings in metric trees (Q372541) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- Convex feasibility modeling and projection methods for sparse signal recovery (Q442713) (← links)
- The method of alternating relaxed projections for two nonconvex sets (Q484479) (← links)
- Convergence analysis for column-action methods in image reconstruction (Q513673) (← links)
- Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← links)
- Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
- Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
- A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space (Q1272854) (← links)
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces (Q1343646) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems (Q1387247) (← links)
- A class of optimized row projection methods for solving large nonsymmetric linear systems (Q1612435) (← links)
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
- A projection method for semidefinite linear systems and its applications (Q1888336) (← links)
- Steered sequential projections for the inconsistent convex feasibility problem (Q1888607) (← links)
- A parallel projection method based on sequential most remote set in convex feasibility problems (Q1907078) (← links)
- Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
- Distributed optimization for degenerate loss functions arising from over-parameterization (Q2060697) (← links)
- A generalized block-iterative projection method for the common fixed point problem induced by cutters (Q2089887) (← links)
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning (Q2101916) (← links)
- A decomposition method for a class of convex generalized Nash equilibrium problems (Q2129213) (← links)
- Feasibility-based fixed point networks (Q2138454) (← 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)
- Improved constraint consensus methods for seeking feasibility in nonlinear programs (Q2377177) (← links)
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems (Q2423796) (← links)
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces (Q2427283) (← links)
- Paved with good intentions: analysis of a randomized block Kaczmarz method (Q2437339) (← links)
- Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces (Q2472273) (← links)
- Randomized Kaczmarz with averaging (Q2660609) (← links)
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem (Q2766137) (← links)
- New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses (Q2789608) (← links)
- Convergence of string-averaging method for a class of operators (Q2829581) (← links)
- Opial-Type Theorems and the Common Fixed Point Problem (Q2897281) (← links)
- Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings (Q2946212) (← links)
- On the behavior of a block-iterative projection method for solving convex feasibility problems (Q3491319) (← links)
- Block Iterative Methods for a Finite Family of Generalized Nonexpansive Mappings in Banach Spaces (Q3506288) (← 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)
- Iterations of parallel convex projections in hilbert spaces (Q4296720) (← links)
- Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters (Q4351445) (← links)
- Choosing the relaxation parameter in sequential block-iterativemethods for linear systems (Q4633311) (← links)
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications (Q4641669) (← links)
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems (Q4653550) (← links)
