Pages that link to "Item:Q1347226"
From MaRDI portal
The following pages link to Block-iterative surrogate projection methods for convex feasibility problems (Q1347226):
Displaying 28 items.
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems (Q501512) (← links)
- Finite convergence of a subgradient projections method with expanding controls (Q649124) (← links)
- 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)
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems (Q2423796) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- Set intersection problems: supporting hyperplanes and quadratic programming (Q2515044) (← 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)
- Block methods for a convex feasibility problem in a Banach space (Q2827903) (← links)
- Opial-Type Theorems and the Common Fixed Point Problem (Q2897281) (← links)
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings (Q2897289) (← links)
- Cases of ineffectiveness of geometric cuts in sequential projection methods (Q3093047) (← 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)
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem (Q4785757) (← links)
- Nonlinear Forward-Backward Splitting with Projection Correction (Q5152477) (← links)
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem (Q5169443) (← links)
- Convergence of weighted averages of relaxed projections (Q5375916) (← links)
- (Q5389724) (← links)
- Obtuse cones and Gram matrices with non-negative inverse (Q5947466) (← links)
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations (Q6112141) (← links)
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints (Q6157447) (← links)
- A finitely convergent circumcenter method for the convex feasibility problem (Q6579996) (← links)
