scientific article
From MaRDI portal
Publication:3581624
zbMath1229.47107MaRDI QIDQ3581624
Publication date: 2 September 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
iterative projection methodsdirected operatorsmultiple split common fixed point problemsparseness of a family of operators
Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (17)
Opial-Type Theorems and the Common Fixed Point Problem ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing ⋮ Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications ⋮ Convergence and perturbation resilience of dynamic string-averaging projection methods ⋮ Iterative methods for solving variational inequalities in Euclidean space ⋮ An extrapolated iterative algorithm for multiple-set split feasibility problem ⋮ Extrapolation and local acceleration of an iterative process for common fixed point problems ⋮ Algorithms for the split variational inequality problem ⋮ Relaxed two points projection method for solving the multiple-sets split equality problem ⋮ Projected subgradient minimization versus superiorization ⋮ Iterative process for solving a multiple-set split feasibility problem ⋮ A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem. ⋮ On Subgradient Projectors ⋮ Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods ⋮ On the finite convergence of a projected cutter method ⋮ Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
This page was built for publication:
