On the string averaging method for sparse common fixed‐point problems
From MaRDI portal
Publication:3563615
DOI10.1111/j.1475-3995.2008.00684.xzbMath1226.47070OpenAlexW2132058804WikidataQ33730560 ScholiaQ33730560MaRDI QIDQ3563615
Publication date: 31 May 2010
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc2839252
Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Numerical solutions to equations with nonlinear operators (65J15) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
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, String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases, Feasibility-based fixed point networks, A non-interior continuation algorithm for solving the convex feasibility problem, Limits of eventual families of sets with application to algorithms for the common fixed point problem, Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning, Inertial-based extragradient algorithm for approximating a common solution of split-equilibrium problems and fixed-point problems of nonexpansive semigroups, 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, On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints, Extrapolation and local acceleration of an iterative process for common fixed point problems, String-averaging incremental stochastic subgradient algorithms, Algorithms for the split variational inequality problem, Iterative algorithm for solving a class of convex feasibility problem, An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space, An inertial method for split common fixed point problems in Hilbert spaces, Projected subgradient minimization versus superiorization, String-averaging projected subgradient methods for constrained minimization, New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses, Convergence of string-averaging method for a class of operators, A generalized block-iterative projection method for the common fixed point problem induced by cutters, Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding common fixed points of a class of paracontractions
- On the inverse function theorem
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
- Decomposition through formalization in a product space
- Cyclic subgradient projections
- Unrestricted iterations of nonexpansive mappings in Hilbert space
- Generalized Gradients and Applications
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- A Geometrical Look at Iterative Methods for Operators with Fixed Points
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
