Showing 2018 · math.OCShow all
3 papers · 2 filters
math.OC2018
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…
math.OC2018
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…
math.OC2018
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…