Iterative process for solving a multiple-set split feasibility problem
From MaRDI portal
Publication:2261981
DOI10.1186/s13660-015-0576-9OpenAlexW2129740661WikidataQ59436016 ScholiaQ59436016MaRDI QIDQ2261981
Publication date: 13 March 2015
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-015-0576-9
Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Equations involving nonlinear operators (general) (47J05)
Related Items (3)
Hybrid CQ projection algorithm with line-search process for the split feasibility problem ⋮ Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ Gradient methods with selection technique for the multiple-sets split feasibility problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extrapolated iterative algorithm for multiple-set split feasibility problem
- A perturbed projection algorithm with inertial technique for split feasibility problem
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- The strong convergence of a KM–CQ-like algorithm for a 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 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
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Iterative process for solving a multiple-set split feasibility problem
