Relaxed outer projections, weighted averages and convex feasibility

From MaRDI portal
Revision as of 10:26, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:751771

DOI10.1007/BF02017349zbMath0715.65038OpenAlexW1971915361MaRDI QIDQ751771

Jochem Zowe, Sjur Didrik Flåm

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02017349




Related Items (31)

Opial-Type Theorems and the Common Fixed Point ProblemA modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert spaceStrong convergence of almost simultaneous block-iterative projection methods in Hilbert spacesBlock-iterative surrogate projection methods for convex feasibility problemsAveraged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria ComputationGeometrically convergent projection method in matrix gamesSubgradient projection algorithms and approximate solutions of convex feasibility problemsA convergence result on random products of mappings in metric spacesA convergence result on random products of mappings in metric treesGeneralized Bregman projections in convex feasibility problemsStrong convergence of expected-projection methods in hilbert spacesFinding projections onto the intersection of convex sets in hilbert spacesBlock Iterative Methods for a Finite Family of Generalized Nonexpansive Mappings in Banach SpacesThe use of additional diminishing disturbances in Fejer models of iterative algorithmsProjection methods for the linear split feasibility problemsLinear convergence rates for extrapolated fixed point algorithmsOn the convergence of Han's method for convex programming with quadratic objectiveA method for approximating the solution set of a system of convex inequalities by polytopesRegular Sequences of Quasi-Nonexpansive Operators and Their ApplicationsIterative method for solving the linear feasibility problemHilbertian convex feasibility problem: Convergence of projection methodsBlock iterative methods for a finite family of relatively nonexpansive mappings in Banach spacesA Norm Convergence Result on Random Products of Relaxed Projections in Hilbert SpaceNon-Convex feasibility problems and proximal point methodsExtrapolation algorithm for affine-convex feasibility problemsSubgradient projection algorithms for convex feasibility problems in the presence of computational errorsConvergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problemsWeak, Strong, and Linear Convergence of a Double-Layer Fixed Point AlgorithmCases of ineffectiveness of geometric cuts in sequential projection methodsA superlinearly convergent projection algorithm for solving the convex inequality problemA generalized block-iterative projection method for the common fixed point problem induced by cutters




Cites Work




This page was built for publication: Relaxed outer projections, weighted averages and convex feasibility