A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem

DOI10.1080/02331934.2014.895898MaRDI QIDQ2808325zbMATHOpenAlexFDO

Authors Songnian He, Ziyi Zhao, Biao Luo

Publication date 23 May 2016

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2014.895898

zbMATH Keywords

Hilbert spacestrong convergencebounded linear operatormultiple-sets split feasibility problemrelaxed CQ algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25)

Recommendations

• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem

Cites work

• A Hybrid Extragradient-Viscosity Method for Monotone Operators and Fixed Point Problems
• A multiprojection algorithm using Bregman projections in a product space
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
• 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
• Fixed points of nonexpanding maps
• Generalized KM theorems and their applications
• 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
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• On variable-step relaxed projection algorithm for variational inequalities
• Perturbation techniques for nonexpansive mappings with applications
• Self-adaptive projection method for co-coercive variational inequalities
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• The relaxed CQ algorithm solving the split feasibility problem
• The strong convergence of a KM-CQ-like algorithm for a split feasibility problem

Cited in

(25)

• Gradient methods with selection technique for the multiple-sets split feasibility problem
• A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem
• Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm
• An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
• Adaptive subgradient method for the split quasi-convex feasibility problems
• An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
• New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
• Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
• A new relaxed method for the split feasibility problem in Hilbert spaces
• Linear approximation method for solving split inverse problems and its applications
• Inertial algorithms with adaptive stepsizes for split variational inclusion problems and their applications to signal recovery problem
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
• The ball-relaxed CQ algorithms for the split feasibility problem
• Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces
• A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings
• Split common fixed point problem of nonexpansive semigroup
• General algorithms for split common fixed point problem of demicontractive mappings
• Self-adaptive algorithms for an equilibrium split problem in Hilbert spaces
• Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
• Ball-relaxed projection algorithms for multiple-sets split feasibility problem
• Modified general splitting method for the split feasibility problem
• The combination projection method for solving convex feasibility problems
• Modified Tseng's extragradient methods with self-adaptive step size for solving bilevel split variational inequality problems

This page was built for publication: A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem

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