Superiorization vs. Accelerated Convex Optimization: The Superiorized/Regularized Least-Squares Case
From MaRDI portal
Publication:6329099
arXiv1911.05498MaRDI QIDQ6329099FDOQ6329099
Authors: Yair Censor, Stefania Petra, Christoph Schnörr 
Publication date: 13 November 2019
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.
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
This page was built for publication: Superiorization vs. Accelerated Convex Optimization: The Superiorized/Regularized Least-Squares Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6329099)
