Pages that link to "Item:Q1111951"

The following pages link to Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951):

Displaying 46 items.

• 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)
• Convergence analysis of a parallel projection algorithm for solving convex feasibility problems (Q501512) (← links)
• Non-monotonous sequential subgradient projection algorithm for convex feasibility problem (Q519264) (← links)
• A modified hybrid projection method for solving generalized mixed equilibrium problems and fixed point problems in Banach spaces (Q660798) (← links)
• A row relaxation method for large minimax problems (Q688632) (← links)
• A new modified hybrid steepest-descent by using a viscosity approximation method with a weakly contractive mapping for a system of equilibrium problems and fixed point problems with minimization problems (Q696010) (← links)
• Modified hybrid block iterative algorithm for uniformly quasi-\(\phi\)-asymptotically nonexpansive mappings (Q696014) (← links)
• Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
• Parallel computing with block-iterative image reconstruction algorithms (Q803769) (← links)
• An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems (Q817152) (← links)
• Vector and parallel computing for matrix balancing (Q922301) (← links)
• A row relaxation method for large \(l_ 1\) problems (Q1176532) (← links)
• A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
• Radiation therapy treatment planning: An \(\mathcal L^ 2\) approach (Q1207809) (← links)
• Descent methods for convex essentially smooth minimization (Q1321119) (← links)
• On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
• A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
• A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
• Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
• A class of optimized row projection methods for solving large nonsymmetric linear systems (Q1612435) (← links)
• Convergence analysis of processes with valiant projection operators in Hilbert space (Q1706406) (← links)
• A new extragradient-type algorithm for the split feasibility problem (Q1793475) (← links)
• Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907) (← links)
• Iterative schemes for the least 2-norm solution of piecewise linear programs (Q1902107) (← links)
• On the Meany inequality with applications to convergence analysis of several row-action iteration methods (Q1955636) (← links)
• Modified hybrid block iterative algorithm for convex feasibility problems and generalized equilibrium problems for uniformly quasi-\(\varphi \)-asymptotically nonexpansive mappings (Q1957572) (← links)
• Spectral methods for spatial resolution improvement of digital images (Q1962490) (← links)
• Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators (Q2015484) (← links)
• An inertial triple-projection algorithm for solving the split feasibility problem (Q2097467) (← links)
• On global randomized block Kaczmarz method for image reconstruction (Q2127572) (← links)
• Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
• On randomized partial block Kaczmarz method for solving huge linear algebraic systems (Q2167431) (← links)
• On the error estimate of the randomized double block Kaczmarz method (Q2287617) (← links)
• Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs (Q2366829) (← links)
• Inertial accelerated algorithms for solving a split feasibility problem (Q2397577) (← links)
• Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems (Q2423796) (← links)
• Algorithms for the quasiconvex feasibility problem (Q2570027) (← links)
• On greedy randomized block Kaczmarz method for consistent linear systems (Q2656635) (← links)
• Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique (Q2943826) (← links)
• An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings (Q2956390) (← links)
• Algorithms for quasiconvex minimization (Q3112506) (← links)
• Relaxed inertial accelerated algorithms for solving split equality feasibility problem (Q4632558) (← links)
• A Partially Greedy Randomized Extended Gauss-Seidel Method for Solving Large Linear Systems (Q5866607) (← links)
• Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications (Q6110101) (← links)