Approximating curve and strong convergence of the CQ algorithm for the split feasibility problem

DOI10.1155/2010/102085MaRDI QIDQ962463zbMATH OpenOpenAlexWikidataFDO

Authors Hong-Kun Xu, Fenghui Wang

Publication date 7 April 2010

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/231154

zbMATH Keywords

algorithmHilbert spacestrong convergencebounded linear operatorsplit feasibility problemminimum-norm solutionTikhonov's regularizationByrne's \(CQ\) algorithm

Mathematics Subject Classification ID

Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52) Numerical solutions to equations with linear operators (65J10)

Recommendations

• 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
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• Two strongly convergent CQ algorithms for split feasibility problem
• A note on the CQ algorithm for the split feasibility problem

Cites work

• scientific article; zbMATH DE number 47597 (Why is no real title available?)
• scientific article; zbMATH DE number 204196 (Why is no real title available?)
• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• A multiprojection algorithm using Bregman projections in a product space
• A note on the CQ algorithm for the split feasibility problem
• 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
• An example concerning fixed points
• Generalized KM theorems and their applications
• Iteration methods for convexly constrained ill-posed problems in hilbert space
• Iterative Algorithms for Nonlinear Operators
• Iterative oblique projection onto convex sets and the split feasibility problem
• Mean Value Methods in Iteration
• Nonlinear Ill-posed Problems of Monotone Type
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• The relaxed CQ algorithm solving the split feasibility problem
• Tikhonov-regularization of ill-posed linear operator equations on closed convex sets

Cited in

(74)

• Implicit and explicit algorithms for solving the split feasibility problem
• Convergence of the modified CQ algorithm and its application in split feasibility problem
• A strong convergence algorithm for a fixed point constrained split null point problem
• A strong convergence algorithm for the two-operator split common fixed point problem in Hilbert spaces
• Ball-relaxed projection algorithms for multiple-sets split feasibility problem
• New algorithms designed for the split common fixed point problem of quasi-pseudocontractions
• General iterative algorithms approach to variational inequalities and minimum-norm fixed point for minimization and split feasibility problems
• The strong convergence theorems for split common fixed point problem of asymptotically nonexpansive mappings in Hilbert spaces
• General alternative regularization methods for nonexpansive mappings in Hilbert spaces
• New inertial method for generalized split variational inclusion problems
• Iterative algorithms for minimum-norm fixed point of non-expansive mapping in Hilbert space
• Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
• Regularized methods for the split feasibility problem
• Strong convergence theorems for the generalized split common fixed point problem
• An explicit method for the split feasibility problem with self-adaptive step sizes
• Forward-backward splitting methods for accretive operators in Banach spaces
• On solving of constrained convex minimize problem using gradient projection method
• Minimum-norm fixed point of nonexpansive mappings with applications
• Superimposed algorithms for the split equilibrium problems and fixed point problems
• A unified iterative treatment for solutions of problems of split feasibility and equilibrium in Hilbert spaces
• A modified Mann iteration by boundary point method for finding minimum-norm fixed point of nonexpansive mappings
• Algorithm for generalized hybrid operators with numerical analysis and applications
• Viscosity approximations considering boundary point method for fixed-point and variational inequalities of quasi-nonexpansive mappings
• A strong convergence theorem for a modified Krasnoselskii iteration method and its application to seepage theory in Hilbert spaces
• A new extragradient-type algorithm for the split feasibility problem
• Algorithmic and analytical approach to the split common fixed points problem
• Boundary point algorithms for minimum norm fixed points of nonexpansive mappings
• Extra-gradient methods for solving split feasibility and fixed point problems
• Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
• Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
• Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints
• The split common fixed point problem for quasi-total asymptotically nonexpansive uniformly Lipschitzian mappings. RETRACTED
• Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications
• The ball-relaxed gradient-projection algorithm for split feasibility problem
• A strong convergence Halpern-type inertial algorithm for solving system of split variational inequalities and fixed point problems
• A new CQ algorithm for solving split feasibility problems in Hilbert spaces
• Hybrid simultaneous algorithms for the split equality problem with applications
• Hybrid steepest descent method for solving the split fixed point problem in Banach spaces
• A regularized algorithm for the proximal split feasibility problem
• Strong convergence theorems for the split common fixed point problem for countable family of nonexpansive operators
• Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
• Affine algorithms for the split variational inequality and equilibrium problems
• New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
• Strong convergence on the split feasibility problem by mixing \(W\)-mapping
• The split common fixed point problem for infinite families of demicontractive mappings
• Strong convergence of a self-adaptive method for the split feasibility problem
• An iterative algorithm for fixed point problem and convex minimization problem with applications
• scientific article; zbMATH DE number 7396551 (Why is no real title available?)
• The split common fixed point problem for infinite families of total quasi-asymptotically nonexpansive operators
• Two relaxed CQ methods for the split feasibility problem with multiple output sets
• Iterative algorithms for the split problem and its convergence analysis
• Hybrid iterative algorithms for the split common fixed point problems
• The common solutions of the split feasibility problems and fixed point problems
• The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
• A note on approximating curve with 1-norm regularization method for the split feasibility problem
• Generalized split null point of sum of monotone operators in Hilbert spaces
• General split feasibility problems in Hilbert spaces
• Two iterative algorithms for solving the split common fixed point problems
• Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
• An algorithm for the split-feasibility problems with application to the split-equality problem
• Strong convergence of an inertial-type algorithm to a common solution of minimization and fixed point problems
• A strongly convergent method for the split feasibility problem
• An inertial extrapolation method for multiple-set split feasibility problem
• The strong convergence of a three-step algorithm for the split feasibility problem
• Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
• A preconditioning method of the CQ algorithm for solving an extended split feasibility problem
• Strong convergence of a hybrid steepest descent method for the split common fixed point problem
• Generalized extragradient iterative methods for solving split feasibility and fixed point problems in Hilbert spaces
• Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications
• Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
• Cyclic algorithms for split feasibility problems in Hilbert spaces
• Generalized relaxed inertial method with regularization for solving split feasibility problems in real Hilbert spaces

This page was built for publication: Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem

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