Pages that link to "Item:Q1347226"
From MaRDI portal
The following pages link to Block-iterative surrogate projection methods for convex feasibility problems (Q1347226):
Displayed 12 items.
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
- Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← links)
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- Generalized Bregman projections in convex feasibility problems (Q1384057) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem (Q2766137) (← links)
- Projection methods for the linear split feasibility problems (Q3514829) (← links)
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization (Q4351184) (← links)
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS (Q4546045) (← links)
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings (Q4678769) (← links)
- Obtuse cones and Gram matrices with non-negative inverse (Q5947466) (← links)