4 papers · 1 filter
Asynchronous Sequential Inertial Iterations for Common Fixed Points Problems with an Application to Linear Systems
Howard Heaton, Yair Censor
The common fixed points problem requires finding a point in the intersection of fixed points sets of a finite collection of operators. Quickly solving problems of this sort is of g…
Derivative-free superiorization with component-wise perturbations
Yair Censor, Howard Heaton, Reinhard Schulte
Superiorization reduces, not necessarily minimizes, the value of a target function while seeking constraints-compatibility. This is done by taking a solely feasibility-seeking algo…
An Improved Method of Total Variation Superiorization Applied to Reconstruction in Proton Computed Tomography
Blake Schultze, Yair Censor, Paniz Karbasi +2
Previous work showed that total variation superiorization (TVS) improves reconstructed image quality in proton computed tomography (pCT). The structure of the TVS algorithm has evo…
Algorithms and Convergence Results of Projection Methods for Inconsistent Feasibility Problems: A Review
Yair Censor, Maroun Zaknoon
The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsist…