Full Text: PDF
Volume 2, Issue 1, 30 April 2020, Pages 15-62
Abstract. We conduct a study and comparison of superiorization and optimization approaches for the reconstruction problem of superiorized / regularized least-squares solutions of underdetermined linear equations with nonnegativity variable bounds. Regarding superiorization, the state of the art is examined for this problem class, and a novel approach is proposed that employs proximal mappings and is structurally similar to the established forward-backward optimization approach. Regarding convex optimization, accelerated forward-backward splitting with inexact proximal maps is worked out and applied to both the natural splitting least-squares term / regularizer and to the reverse splitting regularizer / least-squares term. Our numerical findings suggest that superiorization can approach the solution of the optimization problem and leads to comparable results at significantly lower costs, after appropriate parameter tuning. On the other hand, applying accelerated forward-backward optimization to the reverse splitting slightly outperforms superiorization, which suggests that convex optimization can approach superiorization too, using a suitable problem splitting.
How to Cite this Article:
Yair Censor, Stefania Petra, Christoph Schnörr, Superiorization vs. accelerated convex optimization: The superiorized / regularized least-squares case, J. Appl. Numer. Optim. 2 (2020), 15-62.