Adaptively relaxed algorithms for solving the split feasibility problem with a new step size

DOI10.1186/1029-242X-2014-448zbMath1459.47028OpenAlexW2114621956WikidataQ59324495 ScholiaQ59324495MaRDI QIDQ2405733

Hai-Yun Zhou, Pei-Yuan Wang

Publication date: 26 September 2017

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

Full work available at URL: https://doi.org/10.1186/1029-242x-2014-448

zbMATH Keywords

strong convergenceweak convergencesplit feasibility problemadaptive step sizeadaptively relaxed iterative algorithm

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items

An accelerate algorithm for the split equality common fixed-point problem of directed operators ⋮ New Bregman projection algorithms for solving the split feasibility problem ⋮ A regularization algorithm for a splitting feasibility problem in Hilbert spaces ⋮ Convergence analysis of a Halpern-like iterative algorithm in Hilbert spaces ⋮ Iterative algorithms for solving the split feasibility problem in Hilbert spaces ⋮ Iterative methods for solving a class of monotone variational inequality problems with applications ⋮ The split feasibility problems in an infinite dimensional space ⋮ A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications ⋮ A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings ⋮ Inertial accelerated algorithms for the split common fixed-point problem of directed operators ⋮ Unnamed Item ⋮ A self-adaptive iterative algorithm for the split common fixed point problems ⋮ New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak- and strong-convergence theorems of solutions to split feasibility problem for nonspreading type mapping in Hilbert spaces
• Implicit and explicit algorithms for solving the split feasibility problem
• Accelerated projected gradient method for linear inverse problems with sparsity constraints
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• A multiprojection algorithm using Bregman projections in a product space
• On variable-step relaxed projection algorithm for variational inequalities
• On descent-projection method for solving the split feasibility problems
• Strong convergence of a self-adaptive method for the split feasibility problem
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• Iterative Algorithms for Nonlinear Operators
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• An EM algorithm for wavelet-based image restoration
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• On Projection Algorithms for Solving Convex Feasibility Problems
• A note on the CQ algorithm for the split feasibility problem
• Sparse Image and Signal Processing