Perturbation Resilience and Superiorization of Iterative Algorithms
Y. Censor, R. Davidi, G.T. Herman

TL;DR
This paper introduces a methodology to enhance iterative algorithms by making them 'superiorized' for better optimization performance while maintaining efficiency, especially when the original algorithms are perturbation resilient.
Contribution
It presents a novel superiorization technique that automatically modifies existing perturbation resilient algorithms to improve their optimization capabilities without increasing computational resources.
Findings
Superiority is achieved through perturbations guiding algorithms towards optimal solutions.
Various projection algorithms are shown to be perturbation resilient.
Application to image reconstruction demonstrates practical effectiveness.
Abstract
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there often exist iterative algorithms that impose very little demand on computer resources. For other problems, such as finding that point in the intersection at which the value of a given function is optimal, algorithms tend to need more computer memory and longer execution time. A methodology is presented whose aim is to produce automatically for an iterative algorithm of the first kind a "superiorized version" of it that retains its computational efficiency but nevertheless goes a long way towards solving an optimization problem. This is possible to do if the original algorithm is "perturbation resilient," which is shown to be the case for various projection algorithms for solving the consistent convex…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
