Pages that link to "Item:Q3563615"
From MaRDI portal
The following pages link to On the string averaging method for sparse common fixed‐point problems (Q3563615):
Displayed 24 items.
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- Extrapolation and local acceleration of an iterative process for common fixed point problems (Q442508) (← links)
- Algorithms for the split variational inequality problem (Q663488) (← links)
- Iterative methods for solving variational inequalities in Euclidean space (Q901061) (← links)
- A non-interior continuation algorithm for solving the convex feasibility problem (Q1634140) (← links)
- Iterative algorithm for solving a class of convex feasibility problem (Q1736385) (← links)
- Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
- An inertial method for split common fixed point problems in Hilbert spaces (Q1983401) (← links)
- A generalized block-iterative projection method for the common fixed point problem induced by cutters (Q2089887) (← links)
- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases (Q2138440) (← links)
- Feasibility-based fixed point networks (Q2138454) (← links)
- Limits of eventual families of sets with application to algorithms for the common fixed point problem (Q2158836) (← links)
- Projected subgradient minimization versus superiorization (Q2251567) (← links)
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods (Q2346394) (← links)
- New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses (Q2789608) (← links)
- Convergence of string-averaging method for a class of operators (Q2829581) (← links)
- Opial-Type Theorems and the Common Fixed Point Problem (Q2897281) (← links)
- String-averaging incremental stochastic subgradient algorithms (Q4631774) (← links)
- An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space (Q5396922) (← links)
- String-averaging projected subgradient methods for constrained minimization (Q5746721) (← links)
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning (Q6056101) (← links)
- Inertial-based extragradient algorithm for approximating a common solution of split-equilibrium problems and fixed-point problems of nonexpansive semigroups (Q6062406) (← links)
- Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications (Q6110101) (← links)