13 papers
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
The paper introduces a new theorem of alternatives for the Superiorization Methodology applied to General Dynamic String-Averaging in inconsistent feasibility problems, providing s…
On the boundedness of infinite products of relaxed projections: perturbations resilience and dynamic string-averaging
Daniel Reem, Yair Censor
The paper extends results on the boundedness of infinite products of relaxed projections in Hilbert spaces by allowing perturbations, mixing half-spaces and hyperplanes, and using…
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)…
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…
Superiorization and Perturbation Resilience of Algorithms: A Continuously Updated Bibliography
Yair Censor
This document presents a (mostly) chronologically-ordered bibliography of scientific publications on the superiorization methodology and perturbation resilience of algorithms which…
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…