On the string averaging method for sparse common fixed-point problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5777888
- scientific article; zbMATH DE number 5624813
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- scientific article; zbMATH DE number 6868589
Cites work
- scientific article; zbMATH DE number 2064237 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 1894728 (Why is no real title available?)
- A Geometrical Look at Iterative Methods for Operators with Fixed Points
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Cyclic subgradient projections
- Decomposition through formalization in a product space
- Finding common fixed points of a class of paracontractions
- Generalized Gradients and Applications
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the inverse function theorem
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
- Unrestricted iterations of nonexpansive mappings in Hilbert space
Cited in
(35)- Algorithms for the split variational inequality problem
- An inertial method for split common fixed point problems in Hilbert spaces
- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases
- A non-interior continuation algorithm for solving the convex feasibility problem
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
- Projected subgradient minimization versus superiorization
- Sparsity of integer solutions in the average case
- Convergence of string-averaging method for a class of operators
- String-averaging incremental stochastic subgradient algorithms
- Approaches to iterative algorithms for solving nonlinear equations with an application in tomographic absorption spectroscopy
- scientific article; zbMATH DE number 5777888 (Why is no real title available?)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- scientific article; zbMATH DE number 1894728 (Why is no real title available?)
- A new step size selection strategy for the superiorization methodology using subgradient vectors and its application for solving convex constrained optimization problems
- scientific article; zbMATH DE number 6285845 (Why is no real title available?)
- Extrapolation and local acceleration of an iterative process for common fixed point problems
- A string averaging method based on strictly quasi-nonexpansive operators with generalized relaxation
- Feasibility-based fixed point networks
- Inertial-based extragradient algorithm for approximating a common solution of split-equilibrium problems and fixed-point problems of nonexpansive semigroups
- Iterative algorithm for solving a class of convex feasibility problem
- scientific article; zbMATH DE number 6868589 (Why is no real title available?)
- An algorithm for solving the variational inequality problem over the fixed point set of a quasi-nonexpansive operator in Euclidean space
- String-averaging projected subgradient methods for constrained minimization
- New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them
- Generalized relaxation of string averaging operators based on strictly relaxed cutter operators
- Limits of eventual families of sets with application to algorithms for the common fixed point problem
- Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications
- Iterative methods for solving variational inequalities in Euclidean space
- Centralized circumcentered-reflection method for solving the convex feasibility problem in sparse signal recovery
- Opial-type theorems and the common fixed point problem
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- New Douglas-Rachford algorithmic structures and their convergence analyses
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
This page was built for publication: On the string averaging method for sparse common fixed-point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563615)
