Hybrid CQ projection algorithm with line-search process for the split feasibility problem
From MaRDI portal
Publication:267698
DOI10.1186/s13660-016-1039-7zbMath1343.65065OpenAlexW2324939644WikidataQ59467871 ScholiaQ59467871MaRDI QIDQ267698
Bo Wang, Zhong-Hui Xue, Ya-Zheng Dang
Publication date: 11 April 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-016-1039-7
Related Items (2)
New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem ⋮ A Levenberg-Marquardt method for solving the tensor split feasibility problem
Cites Work
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping
- A multiprojection algorithm using Bregman projections in a product space
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- Iterative process for solving a multiple-set split feasibility problem
- Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
- Variable KM-like algorithms for fixed point problems and split feasibility problems
- Robust solutions of split feasibility problem with uncertain linear operator
- A new halfspace-relaxation projection method for the split feasibility problem
- Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces
- Strong convergence of the CQ method for fixed point iteration processes
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- Strong Convergence of a Proximal-Type Algorithm in a Banach Space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- Split Feasibility and Fixed Point Problems
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
This page was built for publication: Hybrid CQ projection algorithm with line-search process for the split feasibility problem
