Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
From MaRDI portal
Publication:4976159
DOI10.1137/16M1087333zbMath1369.47072arXiv1703.09426OpenAlexW2598996488MaRDI QIDQ4976159
Rafał Zalas, Simeon Reich, Victor I. Kolobov
Publication date: 27 July 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.09426
projection methodconvex feasibility problemcommon fixed point problemquasi-nonexpansive operatorcuttersubgradient projectionblock iterative algorithmsimultaneous projectioncyclic projectionboundedly regular operatordemi-closed operatorboundedly regular familyfejér monotone sequenceremotest-set projection
Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Numerical analysis in abstract spaces (65J99)
Related Items
Asymptotic behaviour of a nonautonomous evolution equation governed by a quasi-nonexpansive operator ⋮ Common solutions to a system of variational inequalities over the set of common fixed points of demi-contractive operators ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Regular Sequences of Quasi-Nonexpansive Operators and Their Applications ⋮ Finitely convergent iterative methods with overrelaxations revisited ⋮ Convergence properties of dynamic string-averaging projection methods in the presence of perturbations ⋮ A generalized block-iterative projection method for the common fixed point problem induced by cutters ⋮ Conical averagedness and convergence analysis of fixed point algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
- Convergence analysis of a block iterative version of the loping Landweber-Kaczmarz iteration
- Iterative methods for fixed point problems in Hilbert spaces
- Convergence analysis for column-action methods in image reconstruction
- Hilbertian convex feasibility problem: Convergence of projection methods
- Relaxed outer projections, weighted averages and convex feasibility
- On the convergence of a class of outer approximation algorithms for convex programs
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- A parallel subgradient projections method for the convex feasibility problem
- A finitely convergent ``row-action method for the convex feasibility problem
- Projection and proximal point methods: Convergence results and counterexamples.
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- An alternating projection that does not converge in norm
- General method for solving the split common fixed point problem
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Mean value iteration of nonexpansive mappings in a Banach space
- Strong and weak convergence of the sequence of successive approximations for quasi-nonexpansive mappings
- Strong convergence of a hybrid steepest descent method for the split common fixed point problem
- The rate of convergence in the method of alternating projections
- Opial-Type Theorems and the Common Fixed Point Problem
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- Landweber-type operator and its properties
- Application of Quasi-Nonexpansive Operators to an Iterative Method for Variational Inequality
- Projection methods: an annotated bibliography of books and reviews
- Characterizing arbitrarily slow convergence in the method of alternating projections
- Decomposition through formalization in a product space
- Cyclic subgradient projections
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators
- On Subgradient Projectors
- A projection method for approximating fixed points of quasi nonexpansive mappings without the usual demiclosedness condition
- The solution by iteration of nonlinear functional equations in Banach spaces
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Minimization of unsmooth functionals
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Theory of Reproducing Kernels
- Functional Operators (AM-22), Volume 2
- The Relaxation Method for Linear Inequalities
- Convex analysis and monotone operator theory in Hilbert spaces
