Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems

From MaRDI portal
Revision as of 16:35, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4653550

DOI10.1080/10556780310001610484zbMath1065.65074OpenAlexW2018657675MaRDI QIDQ4653550

Eli Tom, Yair Censor

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




Related Items (25)

A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert spaceString-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite casesFeasibility-based fixed point networksPerturbation-Resilient Iterative Methods with an Infinite Pool of MappingsA unified treatment of some perturbed fixed point iterative methods with an infinite pool of operatorsDynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planningConvergence of Extrapolated Dynamic StringAveraging Cutter Methods and ApplicationsConvergence and perturbation resilience of dynamic string-averaging projection methodsOn the effectiveness of projection methods for convex feasibility problems with linear inequality constraintsSolving inverse source problems by the orthogonal solution and kernel correction algorithm (OSKCA) with applications in fluorescence tomographyLinear convergence rates for extrapolated fixed point algorithmsUnnamed ItemProjection and proximal point methods: Convergence results and counterexamples.String-averaging incremental stochastic subgradient algorithmsOn the string averaging method for sparse common fixed‐point problemsPerturbation‐resilient block‐iterative projection methods with application to image reconstruction from projectionsProjected subgradient minimization versus superiorizationString-averaging projected subgradient methods for constrained minimizationNew Douglas--Rachford Algorithmic Structures and Their Convergence AnalysesA generalized projection-based scheme for solving convex constrained optimization problemsThe Kaczmarz algorithm, row action methods, and statistical learning algorithmsSubgradient projection algorithms for convex feasibility problems in the presence of computational errorsConvergence of string-averaging method for a class of operatorsThe method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errorsStrict Fejér monotonicity by superiorization of feasibility-seeking projection methods




Cites Work




This page was built for publication: Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems