activity
20122025
most citedConvergence and Perturbation Resilience of Dynamic String-Averaging Projection Methods

72 citations · 103 across the 7 of their papers we have counts for

collaborators

7 papers

math.OC2025

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…

math.OC2023

Global Convergence of Algorithms Based on Unions of Nonexpansive Maps

Alexander J. Zaslavski

In his recent research M. K. Tam (2018) considered a framework for the analysis of iterative algorithms which can be described in terms of a structured set-valued operator. At each…

math.OC2019

Data-compatibility of algorithms

Yair Censor, Maroun Zaknoon, Alexander J. Zaslavski

The data-compatibility approach to constrained optimization, proposed here, strives to a point that is "close enough" to the solution set and whose target function value is "close…

math.FA2018★ 29 cited

Two results in metric fixed point theory

Daniel Reem, Simeon Reich, Alexander J. Zaslavski

We establish two fixed point theorems for certain mappings of contractive type. The first result is concerned with the case where such mappings take a nonempty, closed subset of a…

math.OC2014★ 2 cited

Strict Fejér Monotonicity by Superiorization of Feasibility-Seeking Projection Methods

Yair Censor, Alexander J. Zaslavski

We consider the superiorization methodology, which can be thought of as lying between feasibility-seeking and constrained minimization. It is not quite trying to solve the full fle…

math.OC2013

String-Averaging Projected Subgradient Methods for Constrained Minimization

Y. Censor, A. J. Zaslavski

We consider constrained minimization problems and propose to replace the projection onto the entire feasible region, required in the Projected Subgradient Method (PSM), by projecti…

math.OC2012★ 72 cited

Convergence and Perturbation Resilience of Dynamic String-Averaging Projection Methods

Yair Censor, Alexander J. Zaslavski

We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of string-averaging projection (SAP) methods for the CFP, analyzing their convergence…