The strong convergence of a KM-CQ-like algorithm for a split feasibility problem

DOI10.1088/0266-5611/27/1/015007zbMATH Open1211.65065OpenAlexW2014924278MaRDI QIDQ3074671FDOQ3074671

Authors: Yan Gao, Yazheng Dang 

Publication date: 10 February 2011

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0266-5611/27/1/015007

Recommendations

• The strong convergence of a three-step algorithm for the split feasibility problem
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
• A new iterative algorithm for split solution problems of quasi-nonexpansive mappings
• Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces

zbMATH Keywords

fixed pointnonexpansive mappingstrong convergencebounded linear operatorconvex setHilbert spacessplit feasibility problemiterative processCQ-methodKrasnosel'skii-Mann iterative process

Mathematics Subject Classification ID

Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solution to inverse problems in abstract spaces (65J22) Numerical solutions to equations with linear operators (65J10)

Cited In (91)

• Implicit and explicit algorithms for solving the split feasibility problem
• A novel relaxed projective method for split feasibility problems
• New algorithms designed for the split common fixed point problem of quasi-pseudocontractions
• The strong convergence theorems for split common fixed point problem of asymptotically nonexpansive mappings in Hilbert spaces
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• Modified subgradient extragradient algorithms for variational inequality problems and fixed point problems
• Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
• An explicit method for the split feasibility problem with self-adaptive step sizes
• Regularized methods for the split feasibility problem
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Hybrid CQ projection algorithm with line-search process for the split feasibility problem
• A new self-adaptive CQ algorithm with an application to the LASSO problem
• STRONG CONVERGENCE OF A NEW HYBRID ALGORITHM FOR FIXED POINT PROBLEMS AND EQUILIBRIUM PROBLEMS
• A new extragradient-type algorithm for the split feasibility problem
• Approximation of solutions of split inverse problem for multi-valued demi-contractive mappings in Hilbert spaces
• A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings
• Algorithmic and analytical approach to the split common fixed points problem
• Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
• New inertial relaxed method for solving split feasibilities
• Relaxed two points projection method for solving the multiple-sets split equality problem
• Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints
• An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
• An extrapolated iterative algorithm for multiple-set split feasibility problem
• The split common fixed point problem for quasi-total asymptotically nonexpansive uniformly Lipschitzian mappings. RETRACTED
• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• A new approximation method for finding common fixed points of families of demicontractive operators and applications
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• A new CQ algorithm for solving split feasibility problems in Hilbert spaces
• A regularized algorithm for the proximal split feasibility problem
• A perturbed projection algorithm with inertial technique for split feasibility problem
• Some remarks on the paper ``Strong convergence of a self-adaptive method for the split feasibility problem
• Hybrid simultaneous algorithms for the split equality problem with applications
• Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
• Inertial accelerated algorithms for solving a split feasibility problem
• A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.
• Strong convergence of a self-adaptive method for the split feasibility problem
• An inertial method for solving split common fixed point problems
• Convergence analysis for proximal split feasibility problems and fixed point problems
• Iterative algorithms for the split problem and its convergence analysis
• Variable KM-like algorithms for fixed point problems and split feasibility problems
• The split common fixed point problem for infinite families of total quasi-asymptotically nonexpansive operators
• The common solutions of the split feasibility problems and fixed point problems
• Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces
• Iterative process for solving a multiple-set split feasibility problem
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
• General split feasibility problems in Hilbert spaces
• Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
• Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
• An algorithm for the split-feasibility problems with application to the split-equality problem
• General algorithms for split common fixed point problem of demicontractive mappings
• Strong convergence theorem for multiple sets split feasibility problems in Banach spaces
• A Levenberg-Marquardt method for solving the tensor split feasibility problem
• A strongly convergent method for the split feasibility problem
• Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
• Convergence analysis of a new iterative algorithm for solving split variational inclusion problems
• The strong convergence of a three-step algorithm for the split feasibility problem
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
• Some subgradient extragradient type algorithms for solving split feasibility and fixed point problems
• Global and linear convergence of alternated inertial methods for split feasibility problems
• Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications
• Accelerated subgradient extragradient methods for variational inequality problems
• Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
• Algorithms for the split variational inequality problem
• An implicit algorithm for the split fixed point and convex feasibility problems
• Ball-relaxed projection algorithms for multiple-sets split feasibility problem
• New inertial method for generalized split variational inclusion problems
• New self-adaptive step size algorithms for solving split variational inclusion problems and its applications
• A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
• A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
• Superimposed algorithms for the split equilibrium problems and fixed point problems
• New iterative method with inertial technique for split variational inclusion problem to classify TPACK level of pre-service mathematics teachers
• Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators
• New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem
• Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
• An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings
• Hybrid steepest descent method for solving the split fixed point problem in Banach spaces
• New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
• Affine algorithms for the split variational inequality and equilibrium problems
• Viscosity self-adaptive method for generalized split system of variational inclusion problem
• Hybrid iterative algorithms for the split common fixed point problems
• The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
• Modified general splitting method for the split feasibility problem
• Two iterative algorithms for solving the split common fixed point problems
• Damped algorithms for the split fixed point and equilibrium problems
• An inertial extrapolation method for multiple-set split feasibility problem
• Two strongly convergent CQ algorithms for split feasibility problem
• The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
• Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
• New proximal type algorithms for convex minimization and its application to image deblurring
• Convergence of the modified CQ algorithm and its application in split feasibility problem

This page was built for publication: The strong convergence of a KM-CQ-like algorithm for a split feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3074671)