616 citations · 1.5k across the 61 of their papers we have counts for
69 papers
Parallel Optimization: Theory, Algorithms, and Applications,
Yair Censor, Stavros A. Zenios
This 30 years old book is posted for free download by the generosity of Oxford University Press that granted permission to allow access to future generations of young scientists. A…
The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case
Yair Censor, Daniel Reem
We extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate direction…
A new theorem of alternatives leading to sufficient conditions for the superiorization guarantee question of Dynamic String-Averaging in the inconsistent case
Kay Barshad, Yair Censor
We study the Superiorization Methodology (SM) in the context of the General Dynamic String-Averaging (GDSA) method in the inconsistent case (that is, where the input operators don'…
On the boundedness of infinite products of relaxed projections: perturbations resilience and dynamic string-averaging
Daniel Reem, Yair Censor
Very recently (2026), Bauschke and Tung extended from finite- to infinite-dimensional Hilbert spaces a result published by Meshulam in 1996 (following an earlier result of Aharoni-…
GPU-accelerated superiorization on constrained physical problems with SupPy
Tobias Becher, Yair Censor, Kay Barshad +1
The superiorization method (SM) is situated between feasibility-seeking and constrained optimization. Instead of aiming at the minimum of a given objective function over a constrai…
Strong convergence, perturbation resilience and superiorization of Generalized Modular String-Averaging with infinitely many input operators
Kay Barshad, Yair Censor
We study the strong convergence and bounded perturbation resilience of iterative algorithms based on the Generalized Modular String-Averaging (GMSA) procedure for infinite sequence…
Multi-Criteria Inverse Robustness in Radiotherapy Planning Using Semidefinite Programming
Jan Schröeder, Yair Censor, Philipp Süss +1
Radiotherapy planning naturally leads to a multi-criteria optimization problem which is subject to different sources of uncertainty. In order to find the desired treatment plan, a…
GPU-accelerated FREDopt package for simultaneous dose and LETd proton radiotherapy plan optimization via superiorization methods
Damian Borys, Jan Gajewski, Tobias Becher +9
This study presents FREDopt, a newly developed GPU-accelerated open-source optimization software for simultaneous proton dose and dose-averaged LET (LETd) optimization in IMPT trea…
General Perturbation Resilient Dynamic String-Averaging for Inconsistent Problems with Superiorization
Kay Barshad, Yair Censor
In this paper we introduce a General Dynamic String-Averaging (GDSA) iterative scheme and investigate its convergence properties in the inconsistent case, that is, when the input o…
An iterative process for the feasibility-seeking problem with sets that are unions of convex sets
Yair Censor, Alexander J. Zaslavski
In this paper we deal with the feasibility-seeking problem for unions of convex sets (UCS) sets and propose an iterative process for its solution. Renewed interest in this problem…
A necessary condition for the guarantee of the superiorization method
Kay Barshad, Yair Censor, Walaa Moursi +2
We study a method that involves principally convex feasibility-seeking and makes secondary efforts of objective function value reduction. This is the well-known superiorization met…
New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them
Yair Censor, Daniel Reem, Maroun Zaknoon
Given a Hilbert space and a finite family of operators defined on the space, the common fixed point problem (CFPP) is to find a point in the intersection of the fixed point sets of…
Ionization detail parameters and cluster dose: A mathematical model for selection of nanodosimetric quantities for use in treatment planning in charged particle radiotherapy
Bruce Faddegon, Eleanor A. Blakely, Lucas Burigo +9
Objective: To propose a mathematical model for applying Ionization Detail (ID), the detailed spatial distribution of ionization along a particle track, to proton and ion beam radio…
Immunity to Increasing Condition Numbers of Linear Superiorization versus Linear Programming
Jan Schröder, Yair Censor, Philipp Süss +1
Given a family of linear constraints and a linear objective function one can consider whether to apply a Linear Programming (LP) algorithm or use a Linear Superiorization (LinSup)…
Floorplanning with I/O assignment via feasibility-seeking and superiorization methods
Shan Yu, Yair Censor, Guojie Luo
The feasibility-seeking approach offers a systematic framework for managing and resolving intricate constraints in continuous problems, making it a promising avenue to explore in t…
Approaches to iterative algorithms for solving nonlinear equations with an application in tomographic absorption spectroscopy
F. J. Aragón-Artacho, W. Cai, Y. Censor +3
In this paper we propose an approach for solving systems of nonlinear equations without computing function derivatives. Motivated by the application area of tomographic absorption…
The best approximation pair problem relative to two subsets in a normed space
Daniel Reem, Yair Censor
In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and th…
Per-RMAP: Feasibility-Seeking and Superiorization Methods for Floorplanning with I/O Assignment
Shan Yu, Yair Censor, Ming Jiang +1
The feasibility-seeking approach provides a systematic scheme to manage and solve complex constraints for continuous problems, and we explore it for the floorplanning problems with…
The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets
Yair Censor, Rafiq Mansour, Daniel Reem
Given two nonempty and disjoint intersections of closed and convex subsets, we look for a best approximation pair relative to them, i.e., a pair of points, one in each intersection…
Superiorization: The asymmetric roles of feasibility-seeking and objective function reduction
Yair Censor
The superiorization methodology can be thought of as lying conceptually between feasibility-seeking and constrained minimization. It is not trying to solve the full-fledged constra…
Regularized Nonsmooth Newton Algorithms for Best Approximation
Yair Censor, Walaa M. Moursi, Tyler Weames +1
We consider the problem of finding the best approximation point from a polyhedral set, and its applications, in particular to solving large-scale linear programs. The classical pro…
Superiorization as a novel strategy for linearly constrained inverse radiotherapy treatment planning
Florian Barkmann, Yair Censor, Niklas Wahl
We apply the superiorization methodology to the intensity-modulated radiation therapy (IMRT) treatment planning problem. In superiorization, linear voxel dose inequality constraint…
The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
Francisco J. Aragón-Artacho, Yair Censor, Aviv Gibali +1
In this paper we study the split minimization problem that consists of two constrained minimization problems in two separate spaces that are connected via a linear operator that ma…
A Generalized Block-Iterative Projection Method for the Common Fixed Point Problem Induced by Cutters
Yair Censor, Daniel Reem, Maroun Zaknoon
The block-iterative projections (BIP) method of Aharoni and Censor [Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Linear…