Results

**1 - 4**of**4**### Strict Fejér Monotonicity by Superiorization of Feasibility-Seeking Projection Methods

, 2014

"... 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 t ..."

Abstract
- Add to MetaCart

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 only algorithm. Our main result reveals new information about the mathematical behavior of the superiorization methodology. We deal with a constrained minimization prob-lem with a feasible region, which is the intersection of finitely many closed convex constraint sets, and use the dynamic string-averaging projection method, with variable strings and variable weights, as a feasibility-seeking algorithm. We show that any sequence, generated by the superiorized version of a dynamic string-averaging projection algorithm, not only converges to a feasible point but, addi-tionally, either its limit point solves the constrained minimization problem or the sequence is strictly Fejér monotone with respect to a subset of the solution set of the original problem.

### Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization

"... We review the superiorization methodology, which can be thought of, in some cases, 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 (wit ..."

Abstract
- Add to MetaCart

(Show Context)
We review the superiorization methodology, which can be thought of, in some cases, 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 an objective function value) to one returned by a feasibility-seeking only algorithm. We distinguish between two re-search directions in the superiorization methodology that nourish from the same general principle: Weak superiorization and strong superior-ization and clarify their nature. 1