Pages that link to "Item:Q2149580"
From MaRDI portal
The following pages link to Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems (Q2149580):
Displaying 12 items.
- Finitely convergent iterative methods with overrelaxations revisited (Q2239369) (← links)
- Finite convergence of extragradient-type methods for solving variational inequalities under weak sharp condition (Q2678822) (← links)
- Generic convergence of algorithms for solving stochastic feasibility problems (Q2768021) (← links)
- On finitely convergent iterative methods for the convex feasibility problem (Q3991358) (← links)
- Solving stochastic convex feasibility problems in hilbert spaces (Q4354840) (← links)
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods (Q5210513) (← links)
- Convergence and Semi-Convergence of a Class of Constrained Block Iterative Methods (Q5861977) (← links)
- Convergence of the Cimmino algorithm for common fixed point problems with a countable family of operators (Q6059002) (← links)
- Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space (Q6113524) (← links)
- Finitely Convergent Deterministic and Stochastic Iterative Methods for Solving Convex Feasibility Problems (Q6318719) (← links)
- A finitely convergent circumcenter method for the convex feasibility problem (Q6579996) (← links)
- Approximate solutions for three fixed point problems (Q6655781) (← links)
