By Topic

Stable Convergence Behavior Under Summable Perturbations of a Class of Projection Methods for Convex Feasibility and Optimization Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

We study the convergence behavior of a class of projection methods for solving convex feasibility and optimization problems. We prove that the algorithms in this class converge to solutions of the consistent convex feasibility problem, and that their convergence is stable under summable perturbations. Our class is a subset of the class of string-averaging projection methods, large enough to contain, among many other procedures, a version of the Cimmino algorithm, as well as the cyclic projection method. A variant of our approach is proposed to approximate the minimum of a convex functional subject to convex constraints. This variant is illustrated on a problem in image processing: namely, for optimization in tomography.

Published in:

Selected Topics in Signal Processing, IEEE Journal of  (Volume:1 ,  Issue: 4 )