The following pages link to Yair Censor (Q228633):
Displayed 35 items.
- (Q4524019) (← links)
- Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility (Q4578830) (← links)
- The Split Common Null Point Problem (Q4649759) (← links)
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems (Q4653550) (← links)
- (Q4681446) (← links)
- (Q4718793) (← links)
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem (Q4785757) (← links)
- Block-Iterative Algorithms with Underrelaxed Bregman Projections (Q4785881) (← links)
- PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS (Q4820107) (← links)
- (Q4936263) (← links)
- String-averaging expectation-maximization for maximum likelihood estimation in emission tomography (Q4979738) (← links)
- Algorithms and Convergence Results of Projection Methods for Inconsistent Feasibility Problems: A Review (Q5146251) (← links)
- A method of iterative data refinement and its applications (Q5187117) (← links)
- The Implicit Convex Feasibility Problem and Its Application to Adaptive Image Denoising (Q5276763) (← links)
- Can linear superiorization be useful for linear optimization problems? (Q5346625) (← links)
- The cyclic Douglas–Rachford algorithm with <i>r</i>-sets-Douglas–Rachford operators (Q5379466) (← links)
- (Q5504098) (← links)
- String-averaging projected subgradient methods for constrained minimization (Q5746721) (← links)
- (Q5750347) (← links)
- On Componental Operators in Hilbert Space (Q5861983) (← links)
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems (Q5940992) (← links)
- Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms (Q5955128) (← links)
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization (Q5959328) (← links)
- Bounded perturbation resilience of projected scaled gradient methods (Q5963677) (← links)
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning (Q6056101) (← links)
- Derivative-free superiorization with component-wise perturbations (Q6299802) (← links)
- An analysis of the superiorization method via the principle of concentration of measure (Q6324506) (← links)
- Superiorization vs. Accelerated Convex Optimization: The Superiorized/Regularized Least-Squares Case (Q6329099) (← links)
- Data-compatibility of algorithms (Q6329875) (← links)
- String-Averaging Methods for Best Approximation to Common Fixed Point Sets of Operators: The Finite and Infinite Cases (Q6362801) (← links)
- Limits of eventual families of sets with application to algorithms for the common fixed point problem (Q6392926) (← links)
- A Generalized Block-Iterative Projection Method for the Common Fixed Point Problem Induced by Cutters (Q6397025) (← links)
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning (Q6404748) (← links)
- Regularized Nonsmooth Newton Algorithms for Best Approximation (Q6421751) (← links)
- The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets (Q6433619) (← links)