Perturbation Resilience and Superiorization of Iterative Algorithms

05/01/2010
by   Y. Censor, et al.
0

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 feasibility problem. The superiorized versions of such algorithms use perturbations that drive the process in the direction of the optimizer of the given function. After presenting these intuitive ideas in a precise mathematical form, they are illustrated in image reconstruction from projections for two different projection algorithms superiorized for the function whose value is the total variation of the image.

READ FULL TEXT
research
02/10/2014

Signal Reconstruction Framework Based On Projections Onto Epigraph Set Of A Convex Cost Function (PESC)

A new signal processing framework based on making orthogonal Projections...
research
02/10/2013

Conditional Gradient Algorithms for Norm-Regularized Smooth Convex Optimization

Motivated by some applications in signal processing and machine learning...
research
04/30/2021

A string averaging method based on strictly quasi-nonexpansive operators with generalized relaxation

We study a fixed point iterative method based on generalized relaxation ...
research
03/16/2015

Phase and TV Based Convex Sets for Blind Deconvolution of Microscopic Images

In this article, two closed and convex sets for blind deconvolution prob...
research
02/23/2021

Multi-Group Multicast Beamforming by Superiorized Projections onto Convex Sets

In this paper, we propose an iterative algorithm to address the nonconve...
research
12/14/2020

Successive Projection for Solving Systems of Nonlinear Equations/Inequalities

Solving large-scale systems of nonlinear equations/inequalities is a fun...
research
11/10/2019

A unified approach for projections onto the intersection of ℓ_1 and ℓ_2 balls or spheres

This paper focuses on designing a unified approach for computing the pro...

Please sign up or login with your details

Forgot password? Click here to reset