Strong convergence of a self-adaptive method for the split feasibility problem
From MaRDI portal
Recommendations
- A generalized self-adaptive algorithm for the split feasibility problem in Banach spaces
- Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
- Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
- Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
- Self-adaptive projection methods for the multiple-sets split feasibility problem
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
- A note on the CQ algorithm for the split feasibility problem
- A relaxed projection method for variational inequalities
- A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities.
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A successive projection method
- 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
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- An extragradient method for solving split feasibility and fixed point problems
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Averaged mappings and the gradient-projection algorithm
- Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
- Convex programming in Hilbert space
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Extragradient-projection method for solving constrained convex minimization problems
- scientific article; zbMATH DE number 5624813 (Why is no real title available?)
- scientific article; zbMATH DE number 4021000 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Implicit relaxed and hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense
- Inexact operator splitting methods with selfadaptive strategy for variational inequality problems
- Iterative Algorithms for Nonlinear Operators
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- On the convergence of Han's method for convex programming with quadratic objective
- On variable-step relaxed projection algorithm for variational inequalities
- Regularized methods for the split feasibility problem
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Self-adaptive projection method for co-coercive variational inequalities
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Several solution methods for the split feasibility problem
- Solving linear variational inequality problems by a self-adaptive projection method
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- The method of projections for finding the common point of convex sets
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed inexact projection methods for the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
Cited in
(62)- A strongly convergent algorithm for the split common fixed point problem
- Iterative algorithms for the split problem and its convergence analysis
- On the split feasibility problem and fixed point problem of quasi--nonexpansive mapping in Banach spaces
- A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
- A strong convergence theorem for an iterative method for solving the split variational inequalities in Hilbert spaces
- Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
- Self adaptive inertial relaxed CQ algorithms for solving split feasibility problem with multiple output sets
- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
- Linear approximation method for solving split inverse problems and its applications
- A generalized self-adaptive algorithm for the split feasibility problem in Banach spaces
- Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
- Solving the split feasibility problem and the fixed point problem of left Bregman firmly nonexpansive mappings via the dynamical step sizes in Banach spaces
- Generalized extragradient iterative methods for solving split feasibility and fixed point problems in Hilbert spaces
- Self-adaptive algorithms with inertial effects for solving the split problem of the demicontractive operators
- Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators
- New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
- The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
- Preconditioning methods for solving a general split feasibility problem
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
- On split common solution problems: new nonlinear feasible algorithms, strong convergence results and their applications
- New algorithms designed for the split common fixed point problem of quasi-pseudocontractions
- Self-adaptive forward-backward contraction-type methods for generalized split feasibility problems
- Self-adaptive algorithms for solving split feasibility problem with multiple output sets
- Simultaneous iterative algorithms for the split common fixed-point problem of generalized asymptotically quasi-nonexpansive mappings without prior knowledge of operator norms
- Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction
- Extra-gradient methods for solving split feasibility and fixed point problems
- Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
- Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
- Weak convergence of a Mann-like algorithm for nonexpansive and accretive operators
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- Alternating Mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings
- Self-adaptive algorithms for the split problem of the demicontractive operators
- Fixed point algorithms for the split problem of demicontractive operators
- Strong convergence theorems for a nonexpansive mapping and its applications for solving the split feasibility problem
- The split variational inequality problem and its algorithm iteration
- The split common fixed-point problem for demicontractive mappings and quasi-nonexpansive mappings
- Simultaneous iterative algorithm for the split equality fixed-point problem of demicontractive mappings
- A projected fixed point algorithm with Meir-Keeler contraction for pseudocontractive mappings
- Iterative algorithms for the split variational inequality and fixed point problems under nonlinear transformations
- Viscosity approximation methods for the multiple-set split equality common fixed-point problems of demicontractive mappings
- An iterative viscosity approximation method for the split common fixed-point problem
- Weak and strong convergence theorems for the split common fixed point problem with demicontractive operators
- Three-step iterations for total asymptotically nonexpansive mappings in CAT(0) spaces
- Strong convergence theorems for an implicit iterative algorithm for the split common fixed point problem
- Self-adaptive projection and contraction methods with alternated inertial terms for solving the split feasibility problem
- scientific article; zbMATH DE number 7489380 (Why is no real title available?)
- Two iterative algorithms for solving the split common fixed point problems
- scientific article; zbMATH DE number 7574093 (Why is no real title available?)
- Gradient methods with selection technique for the multiple-sets split feasibility problem
- Viscosity approximation methods for split common fixed-point problem of directed operators
- Strong convergence theorems for the general split common fixed point problem in Hilbert spaces
- An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net
- Weak and strong convergence theorems for the multiple-set split equality common fixed-point problems of demicontractive mappings
- The approximate solution of the general split variational inequality problem by intermixed iteration
- Self-adaptive CQ-type algorithms for the split feasibility problem involving two bounded linear operators in Hilbert spaces
- Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
- Alternated dual inertial concurring algorithms for the generalized variational inclusion problems with applications
- Modified inertial self-adaptive techniques for the split feasibility problem
- Some remarks on the paper ``Strong convergence of a self-adaptive method for the split feasibility problem
- Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings
- The common solutions of the split feasibility problems and fixed point problems
This page was built for publication: Strong convergence of a self-adaptive method for the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253220)
