Parallel application of block-iterative methods in medical imaging and radiation therapy

From MaRDI portal
Publication:1111951

DOI10.1007/BF01589408zbMath0658.90099MaRDI QIDQ1111951

Yair Censor

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)




Related Items

Asymptotically optimal row-action methods for generalized least squares problems, On global randomized block Kaczmarz method for image reconstruction, Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs, A multiprojection algorithm using Bregman projections in a product space, Block-iterative surrogate projection methods for convex feasibility problems, Efficient projection onto a low-dimensional ball, Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration, An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces, Iterative schemes for the least 2-norm solution of piecewise linear programs, A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm, Inertial accelerated algorithms for solving a split feasibility problem, On greedy randomized block Kaczmarz method for consistent linear systems, On randomized partial block Kaczmarz method for solving huge linear algebraic systems, A convergence result on random products of mappings in metric spaces, A convergence result on random products of mappings in metric trees, Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique, On the behavior of a block-iterative projection method for solving convex feasibility problems, Strong convergence of expected-projection methods in hilbert spaces, An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings, Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications, Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems, On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems, Convergence analysis of processes with valiant projection operators in Hilbert space, On the Meany inequality with applications to convergence analysis of several row-action iteration methods, Modified hybrid block iterative algorithm for convex feasibility problems and generalized equilibrium problems for uniformly quasi-\(\varphi \)-asymptotically nonexpansive mappings, Vector and parallel computing for matrix balancing, Spectral methods for spatial resolution improvement of digital images, Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization, Approximating solutions of split equality of some nonlinear optimization problems using an inertial algorithm, A row relaxation method for large \(l_ 1\) problems, A modified hybrid projection method for solving generalized mixed equilibrium problems and fixed point problems in Banach spaces, Relaxed inertial accelerated algorithms for solving split equality feasibility problem, A method for approximating the solution set of a system of convex inequalities by polytopes, Convergence analysis of a parallel projection algorithm for solving convex feasibility problems, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, Non-monotonous sequential subgradient projection algorithm for convex feasibility problem, A row relaxation method for large minimax problems, Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem, Radiation therapy treatment planning: An \(\mathcal L^ 2\) approach, 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, Modified hybrid block iterative algorithm for uniformly quasi-\(\phi\)-asymptotically nonexpansive mappings, A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space, Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators, A new extragradient-type algorithm for the split feasibility problem, On the error estimate of the randomized double block Kaczmarz method, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, Relaxed outer projections, weighted averages and convex feasibility, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, The hybrid projection algorithm for finding the common fixed points of nonexpansive mappings and the zeroes of maximal monotone operators in Banach spaces, Algorithms for quasiconvex minimization, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, Algorithms for the quasiconvex feasibility problem, An inertial triple-projection algorithm for solving the split feasibility problem, Parallel computing with block-iterative image reconstruction algorithms, A Partially Greedy Randomized Extended Gauss-Seidel Method for Solving Large Linear Systems, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization, A unified description of iterative algorithms for traffic equilibria, An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems, A class of optimized row projection methods for solving large nonsymmetric linear systems



Cites Work