String-averaging algorithms for convex feasibility with infinitely many sets
From MaRDI portal
Publication:5382471
Abstract: Algorithms for convex feasibility find or approximate a point in the intersection of given closed convex sets. Typically there are only finitely many convex sets, but the case of infinitely many convex sets also has some applications. In this context, a emph{string} is a finite sequence of points each of which is obtained from the previous point by considering one of the convex sets. In a emph{string-averaging} algorithm, an iterative step from a first point to a second point computes a number of strings, all starting with the first point, and then calculates a (weighted) average of those strings' end-points: This average is that iterative step's second point, which is used as the first point for the next iterative step. For string-averaging algorithms based on strings in which each point either is the projection of the previous point on one of the convex sets or is equal to the previous point, we present theorems that provide answers to the following question: "How can the iterative steps be specified so that the string-averaging algorithm generates a convergent sequence whose limit lies in the intersection of the sets of a given convex feasibility problem?" This paper focuses on the case where the given collection of convex sets is infinite, whereas prior work on the same question that we are aware of has assumed the collection of convex sets is finite (or has been applicable only to a small subset of the algorithms we consider). The string-averaging algorithms that are shown to generate a convergent sequence whose limit lies in the intersection are also shown to be perturbation resilient, so they can be superiorized to generate sequences that also converge to a point of the intersection but in a manner that is superior with respect to some application-dependent criterion.
Recommendations
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- scientific article; zbMATH DE number 6285845
- On finitely convergent iterative methods for the convex feasibility problem
- String-averaging projected subgradient methods for constrained minimization
Cites work
- A discrete spherical x-ray transform of orientation distribution functions using bounding cubes
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- An explicit construction of sunny nonexpansive retractions in Banach spaces
- Approximation methods for common fixed points of infinite countable family of nonexpansive mappings
- Averaging strings of sequential iterations for convex feasibility problems.
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Can linear superiorization be useful for linear optimization problems?
- Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- Energy-based sensor network source localization via projection onto convex sets
- Hilbertian convex feasibility problem: Convergence of projection methods
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- scientific article; zbMATH DE number 705150 (Why is no real title available?)
- scientific article; zbMATH DE number 2182577 (Why is no real title available?)
- Perturbation resilience and superiorization of iterative algorithms
- Perturbation-resilient iterative methods with an infinite pool of mappings
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- The method of projections for finding the common point of convex sets
- Unrestricted iterations of nonexpansive mappings in Hilbert space
- Weak and strong superiorization: between feasibility-seeking and minimization
Cited in
(13)- Convergence and perturbation resilience of dynamic string-averaging projection methods
- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases
- scientific article; zbMATH DE number 6868589 (Why is no real title available?)
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- scientific article; zbMATH DE number 6285845 (Why is no real title available?)
- Convergence of the Cimmino algorithm for common fixed point problems with a countable family of operators
- Approximate solutions for three fixed point problems
- General perturbation resilient dynamic string-averaging for inconsistent problems with superiorization
- Solving common fixed point problems with a countable family of operators
- Convergence of the string-averaging algorithm for common fixed point problems with a countable family of operators
- A new theorem of alternatives leading to sufficient conditions for the superiorization guarantee question of Dynamic String-Averaging in the inconsistent case
- Optimization on solution sets of common fixed point problems with a countable family of maps
- A new theorem of alternatives leading to sufficient conditions for the superiorization guarantee question of dynamic string-averaging in the inconsistent case
This page was built for publication: String-averaging algorithms for convex feasibility with infinitely many sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5382471)
