5 problems

Superiorization robustness explanation conjecture. The observed robustness of the superiorization methodology with respect to increasing condition numbers is due to the fact that i…

Geometric–Bregman conjecture. A geometric basic algorithm that smoothly evolves on a manifold defined by the constraints, together with a proximal point that employs an appropriate…

Superiorization strict-improvement conjecture. The considerations based on concentration of measure should imply a conclusion stronger than

Large-scale performance conjecture. There exists a size level of huge problems above which LinSup will perform better than linear minimization algorithms.

Let $\boldsymbol{d}$ denote the direction selected in the superiorization method, and suppose it is chosen either using subgradients as discussed in the paper or by the more approp…