Strong convergence of two algorithms for the split feasibility problem in Banach spaces
From MaRDI portal
Publication:4646522
DOI10.1080/02331934.2018.1483365zbMath1416.90056OpenAlexW2809678634WikidataQ129685061 ScholiaQ129685061MaRDI QIDQ4646522
Publication date: 14 January 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1483365
Related Items (7)
The ball-relaxed gradient-projection algorithm for split feasibility problem ⋮ A generalized self-adaptive algorithm for the split feasibility problem in Banach spaces ⋮ An inertial method for split common fixed point problems in Hilbert spaces ⋮ On the shrinking projection method for the split feasibility problem in Banach spaces ⋮ Strong convergence on the split feasibility problem by mixing \(W\)-mapping ⋮ The strong convergence of Douglas-Rachford methods for the split feasibility problem ⋮ The Strongly Convergent Relaxed Alternating CQ Algorithms for the Split Equality Problem in Hilbert Spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Properties and iterative methods for the lasso and its variants
- A multiprojection algorithm using Bregman projections in a product space
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Polyak's gradient method for split feasibility problem constrained by level sets
- Solving the split feasibility problem without prior knowledge of matrix norms
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Bregman Monotone Optimization Algorithms
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- A New Algorithm for Solving The Multiple-Sets Split Feasibility Problem in Banach Spaces
- Signal Recovery by Proximal Forward-Backward Splitting
This page was built for publication: Strong convergence of two algorithms for the split feasibility problem in Banach spaces