5 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
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'…
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…
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…
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…