An Analysis of the Superiorization Method via the Principle of Concentration of Measure

Yair Censor, Eliahu Levy

Research output: Contribution to journalArticlepeer-review


The superiorization methodology is intended to work with input data of constrained minimization problems, i.e., a target function and a constraints set. However, it is based on an antipodal way of thinking to the thinking that leads constrained minimization methods. Instead of adapting unconstrained minimization algorithms to handling constraints, it adapts feasibility-seeking algorithms to reduce (not necessarily minimize) target function values. This is done while retaining the feasibility-seeking nature of the algorithm and without paying a high computational price. A guarantee that the local target function reduction steps properly accumulate to a global target function value reduction is still missing in spite of an ever-growing body of publications that supply evidence of the success of the superiorization method in various problems. We propose an analysis based on the principle of concentration of measure that attempts to alleviate this guarantee question of the superiorization method.

Original languageEnglish
Pages (from-to)2273-2301
Number of pages29
JournalApplied Mathematics and Optimization
Issue number3
StatePublished - Jun 2021

Bibliographical note

Publisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.


  • Concentration of measure
  • Feasibility-seeking algorithm
  • Hilbert-Schmidt norm
  • Linear superiorization
  • Perturbation resilience
  • Random matrix
  • Superiorization
  • Superiorization matrix
  • Target function reduction

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'An Analysis of the Superiorization Method via the Principle of Concentration of Measure'. Together they form a unique fingerprint.

Cite this