Generalized relaxation of string averaging operators based on strictly relaxed cutter operators

zbMath1384.90071arXiv1706.06675MaRDI QIDQ3134274

Mahdi Mirzapour, Touraj Nikazad

Publication date: 9 February 2018

Full work available at URL: https://arxiv.org/abs/1706.06675

zbMATH Keywords

convex feasibility problemstring averagingstrictly quasi-nonexpansive operatorgeneralized relaxationrelaxed cutter operator

Mathematics Subject Classification ID

Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Numerical methods of relaxation type (49M20)

Related Items

Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications ⋮ Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour ⋮ Linear convergence rates for extrapolated fixed point algorithms