dynamic string-averaging projections

Superiorization: The asymmetric roles of feasibility-seeking and objective function reduction

Published: 2022/12/30

The superiorization methodology can be thought of as lying conceptually between feasibility-seeking and constrained minimization. It is not trying to solve the full-fledged constrained minimization problem composed from the modeling constraints and the chosen objective function. Rather, the task is to find a feasible point which is “superior” (in a well-defined manner) with respect to … Read more

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

Published: 2014/05/28

Yair Censor

Alexander J. Zaslavski

Constrained Nonlinear Optimization, Parallel Algorithms bounded perturbation resilience, constrained minimization, convex feasibility problem, dynamic string-averaging projections, strict fejér monotonicity, subgradients, superiorization methodology, superiorized version of an algorithm

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 fledged constrained minimization problem; rather, the task is to find a feasible point which is superior (with respect to the objective function value) to one returned by a feasibility-seeking … Read more