Pages that link to "Item:Q751771"
From MaRDI portal
The following pages link to Relaxed outer projections, weighted averages and convex feasibility (Q751771):
Displaying 21 items.
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- Subgradient projection algorithms and approximate solutions of convex feasibility problems (Q364738) (← links)
- A convergence result on random products of mappings in metric spaces (Q368395) (← links)
- A convergence result on random products of mappings in metric trees (Q372541) (← links)
- Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← links)
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (Q741092) (← links)
- Iterative method for solving the linear feasibility problem (Q946322) (← links)
- On the convergence of Han's method for convex programming with quadratic objective (Q1181736) (← links)
- A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces (Q1343646) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Generalized Bregman projections in convex feasibility problems (Q1384057) (← links)
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
- Geometrically convergent projection method in matrix games (Q1897450) (← links)
- A generalized block-iterative projection method for the common fixed point problem induced by cutters (Q2089887) (← links)
- Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces (Q2472273) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- Opial-Type Theorems and the Common Fixed Point Problem (Q2897281) (← links)
- Cases of ineffectiveness of geometric cuts in sequential projection methods (Q3093047) (← links)
- The use of additional diminishing disturbances in Fejer models of iterative algorithms (Q6191486) (← links)