Pages that link to "Item:Q3991358"
From MaRDI portal
The following pages link to On finitely convergent iterative methods for the convex feasibility problem (Q3991358):
Displaying 13 items.
- A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method (Q467410) (← links)
- Finite convergence of a subgradient projections method with expanding controls (Q649124) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- Generalization: One technique of computational and applied mathematical methodology (Q932560) (← links)
- About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I (Q1347165) (← links)
- Stability of a convex feasibility problem (Q2010108) (← links)
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems (Q2149580) (← links)
- Finitely convergent iterative methods with overrelaxations revisited (Q2239369) (← links)
- On the finite convergence of a projected cutter method (Q2349845) (← links)
- On the Mann-type iteration and the convex feasibility problem (Q2468142) (← links)
- Iterative approximation to convex feasibility problems in Banach space (Q2472281) (← links)
- (Q3517685) (← links)
- String-averaging algorithms for convex feasibility with infinitely many sets (Q5382471) (← links)
