Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
From MaRDI portal
Publication:4653550
DOI10.1080/10556780310001610484zbMath1065.65074OpenAlexW2018657675MaRDI QIDQ4653550
Publication date: 7 March 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780310001610484
algorithmconvergenceprojection methodsproduct spaceinconsistent feasibility problemstring-averaging algorithm
Related Items (25)
A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ Feasibility-based fixed point networks ⋮ Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings ⋮ A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators ⋮ Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning ⋮ Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications ⋮ Convergence and perturbation resilience of dynamic string-averaging projection methods ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Solving inverse source problems by the orthogonal solution and kernel correction algorithm (OSKCA) with applications in fluorescence tomography ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Unnamed Item ⋮ Projection and proximal point methods: Convergence results and counterexamples. ⋮ String-averaging incremental stochastic subgradient algorithms ⋮ On the string averaging method for sparse common fixed‐point problems ⋮ Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections ⋮ Projected subgradient minimization versus superiorization ⋮ String-averaging projected subgradient methods for constrained minimization ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ The Kaczmarz algorithm, row action methods, and statistical learning algorithms ⋮ Subgradient projection algorithms for convex feasibility problems in the presence of computational errors ⋮ Convergence of string-averaging method for a class of operators ⋮ The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors ⋮ Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Successive projections on hyperplanes
- Projection methods for systems of equations
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- On products of projections
- A limit theorem for projections
- Decomposition through formalization in a product space
- On Projection Algorithms for Solving Convex Feasibility Problems
- NONEXPANSIVE NONLINEAR OPERATORS IN A BANACH SPACE
- The solution by iteration of nonlinear functional equations in Banach spaces
- Nonlinear equations of evolution and nonlinear accretive operators in Banach spaces
- The method of projections for finding the common point of convex sets
- Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
This page was built for publication: Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems