A new extragradient-type algorithm for the split feasibility problem
From MaRDI portal
Publication:1793475
DOI10.1155/2016/6851393zbMath1400.90301OpenAlexW2280383143WikidataQ59141110 ScholiaQ59141110MaRDI QIDQ1793475
Bo Wang, Yan Gao, Ya-Zheng Dang
Publication date: 12 October 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/6851393
Numerical mathematical programming methods (65K05) Convex programming (90C25) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Programming in abstract spaces (90C48)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- An extragradient method for solving split feasibility and fixed point problems
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- A multiprojection algorithm using Bregman projections in a product space
- Weak convergence theorems for nonexpansive mappings and monotone mappings
- Variant extragradient-type method for monotone variational inequalities
- Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings
- A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
- Iterative Algorithms for Nonlinear Operators
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
