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

DOI10.1088/0266-5611/27/1/015007zbMath1211.65065OpenAlexW2014924278MaRDI QIDQ3074671

Yan Gao, Ya-Zheng 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

zbMATH Keywords

strong convergencefixed pointnonexpansive mappingHilbert spacesconvex setiterative processbounded linear operatorsplit feasibility problemCQ-methodKrasnosel'skii-Mann iterative process

Mathematics Subject Classification ID

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

Related Items (87)

The strong convergence theorems for split common fixed point problem of asymptotically nonexpansive mappings in Hilbert spaces ⋮ 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 ⋮ Algorithmic and analytical approach to the split common fixed points problem ⋮ Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis ⋮ Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ Hybrid simultaneous algorithms for the split equality problem with applications ⋮ Some subgradient extragradient type algorithms for solving split feasibility and fixed point problems ⋮ Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces ⋮ Inertial accelerated algorithms for solving a split feasibility problem ⋮ The strong convergence of a three-step algorithm for the split feasibility problem ⋮ Two iterative algorithms for solving the split common fixed point problems ⋮ The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem ⋮ Superimposed algorithms for the split equilibrium problems and fixed point problems ⋮ 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 ⋮ Variable KM-like algorithms for fixed point problems and split feasibility problems ⋮ New inertial method for generalized split variational inclusion problems ⋮ Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces ⋮ Unnamed Item ⋮ An algorithm for the split-feasibility problems with application to the split-equality problem ⋮ An inertial method for solving split common fixed point problems ⋮ Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints ⋮ Strong convergence theorems for the split variational inclusion problem in Hilbert spaces ⋮ On the convergence analysis of the gradient-CQ algorithms 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 ⋮ Regularized methods for the split feasibility problem ⋮ An explicit method for the split feasibility problem with self-adaptive step sizes ⋮ The common solutions of the split feasibility problems and fixed point problems ⋮ A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem ⋮ New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem ⋮ General split feasibility problems in Hilbert spaces ⋮ 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 ⋮ A perturbed projection algorithm with inertial technique for split feasibility problem ⋮ Applications of fixed-point and optimization methods to the multiple-set split feasibility problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Damped algorithms for the split fixed point and equilibrium problems ⋮ Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces ⋮ The split common fixed point problem for infinite families of total quasi-asymptotically nonexpansive operators ⋮ A regularized algorithm for the proximal split feasibility problem ⋮ Iterative algorithms for the split problem and its convergence analysis ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ Hybrid iterative algorithms for the split common fixed point problems ⋮ Algorithms for the split variational inequality problem ⋮ Modified subgradient extragradient algorithms for variational inequality problems and fixed point problems ⋮ Relaxed two points projection method for solving the multiple-sets split equality problem ⋮ Unnamed Item ⋮ Affine algorithms for the split variational inequality and equilibrium problems ⋮ Strong convergence of a self-adaptive method for the split feasibility problem ⋮ A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems ⋮ Implicit and explicit algorithms for solving the split feasibility problem ⋮ A strongly convergent method for the split feasibility problem ⋮ Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications ⋮ Iterative process for solving a multiple-set split feasibility problem ⋮ Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators ⋮ A new CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ ``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 ⋮ General algorithms for split common fixed point problem of demicontractive mappings ⋮ A new extragradient-type algorithm for the split feasibility problem ⋮ New self-adaptive step size algorithms for solving split variational inclusion problems and its applications ⋮ STRONG CONVERGENCE OF A NEW HYBRID ALGORITHM FOR FIXED POINT PROBLEMS AND EQUILIBRIUM PROBLEMS ⋮ Viscosity self-adaptive method for generalized split system of variational inclusion problem ⋮ A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem ⋮ A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem. ⋮ New inertial relaxed method for solving split feasibilities ⋮ Some remarks on the paper ``Strong convergence of a self-adaptive method for the split feasibility problem ⋮ Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces ⋮ A Levenberg-Marquardt method for solving the tensor split feasibility problem ⋮ Unnamed Item ⋮ A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications ⋮ Strong Convergence Theorem for Multiple Sets Split Feasibility Problems in Banach Spaces ⋮ An inertial extrapolation method for multiple-set split feasibility problem ⋮ An implicit algorithm for the split fixed point and convex feasibility problems ⋮ Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces ⋮ The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem ⋮ Convergence analysis of a new iterative algorithm for solving split variational inclusion problems ⋮ New proximal type algorithms for convex minimization and its application to image deblurring ⋮ Accelerated subgradient extragradient methods for variational inequality problems ⋮ Convergence analysis for proximal split feasibility problems and fixed point problems ⋮ Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem ⋮ New algorithms designed for the split common fixed point problem of quasi-pseudocontractions ⋮ New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem

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