Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
From MaRDI portal
(Redirected from Publication:5217258)
Abstract: We consider the split convex feasibility problem in a fixed point setting. Motivated by the well-known CQ-method of Byrne (2002), we define an abstract andweber transform which applies to more general operators than the metric projection. We call the result of this transform a Landweber operator. It turns out that the Landweber transform preserves many interesting properties. For example, the Landweber transform of a (quasi/firmly) nonexpansive mapping is again (quasi/firmly) nonexpansive. Moreover, the Landweber transform of a (weakly/linearly) regular mapping is again (weakly/linearly) regular. The preservation of regularity is important because it leads to (weak/linear) convergence of many CQ-type methods.
Recommendations
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
- Convergence of the modified CQ algorithm and its application in split feasibility problem
- The Landweber operator approach to the split equality problem
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A note on the CQ algorithm for the split feasibility problem
- A note on the multiple-set split convex feasibility problem in Hilbert space
- A note on the split common fixed-point problem for quasi-nonexpansive operators
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Algorithms for the split variational inequality problem
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Averaged mappings and the gradient-projection algorithm
- Best approximation in inner product spaces
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- General method for solving the split common fixed point problem
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 7399145 (Why is no real title available?)
- scientific article; zbMATH DE number 5624813 (Why is no real title available?)
- scientific article; zbMATH DE number 3671159 (Why is no real title available?)
- scientific article; zbMATH DE number 3244852 (Why is no real title available?)
- scientific article; zbMATH DE number 3108780 (Why is no real title available?)
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- Iterative methods for fixed point problems in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Landweber-type operator and its properties
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Linear convergence rates for extrapolated fixed point algorithms
- Linear integral equations
- Mean value iteration of nonexpansive mappings in a Banach space
- Mean Value Methods in Iteration
- Methods for variational inequality problem over the intersection of fixed point sets of quasi-nonexpansive operators
- Moduli of regularity and rates of convergence for Fejér monotone sequences
- On Projection Algorithms for Solving Convex Feasibility Problems
- On variable-step relaxed projection algorithm for variational inequalities
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Projected Landweber iteration for matrix completion
- Projected Landweber method and preconditioning
- Properties of a class of approximately shrinking operators and their applications
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving the split feasibility problem without prior knowledge of matrix norms
- 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
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
- The application of an oblique-projected Landweber method to a model of supervised learning
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed CQ algorithm solving the split feasibility problem
- Viscosity approximation process for a sequence of quasinonexpansive mappings
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(20)- An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings
- An inertial extrapolation method for multiple-set split feasibility problem
- Steepest-descent block-iterative methods for a finite family of quasi-nonexpansive mappings
- Finitely convergent iterative methods with overrelaxations revisited
- Solving a general split equality problem without prior knowledge of operator norms in Banach spaces
- Self-adaptive forward-backward contraction-type methods for generalized split feasibility problems
- Landweber-type operator and its properties
- Convergence analysis of new inertial method for the split common null point problem
- An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
- Outer approximation methods for solving variational inequalities defined over the solution set of a split convex feasibility problem
- The Landweber operator approach to the split equality problem
- Convergence and semi-convergence of a class of constrained block iterative methods
- A new self-adaptive method for the multiple-sets split common null point problem in Banach spaces
- New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem
- Strict pseudocontractions and demicontractions, their properties, and applications
- Block-iterative schemes for the split common fixed point problem and applications
- Regularity of the product of two relaxed cutters with relaxation parameters beyond two
- On linear convergence of Landweber-type methods
- The convergence properties for regularized Landweber method
- Hyperplane projection algorithm for split equality problems in Hilbert spaces
This page was built for publication: Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217258)
