Strong convergence of two algorithms for the split feasibility problem in Banach spaces
From MaRDI portal
Publication:4646522
DOI10.1080/02331934.2018.1483365zbMATH Open1416.90056OpenAlexW2809678634WikidataQ129685061 ScholiaQ129685061MaRDI QIDQ4646522FDOQ4646522
Authors: Fenghui Wang 
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
Recommendations
- Strong convergence theorems by hybrid methods for the split feasibility problem in Banach spaces
- Strong convergence result of split feasibility problems in Banach spaces
- Iterative methods for split feasibility problems in certain Banach spaces
- Iterative methods for the split feasibility problem in Banach spaces
- Iterative methods for solving split feasibility problems and fixed point problems in Banach spaces
Cites Work
- Title not available (Why is that?)
- A multiprojection algorithm using Bregman projections in a product space
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Signal Recovery by Proximal Forward-Backward Splitting
- Nonlinear functional analysis. Fixed point theory and its applications
- Title not available (Why is that?)
- Bregman Monotone Optimization Algorithms
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Title not available (Why is that?)
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Properties and iterative methods for the lasso and its variants
- Title not available (Why is that?)
- The split feasibility problem in Banach spaces
- A new algorithm for solving the multiple-sets split feasibility problem in Banach spaces
- Title not available (Why is that?)
- Polyak's gradient method for split feasibility problem constrained by level sets
Cited In (17)
- 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 theorem of two-step iterative algorithm for split feasibility problems
- Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces
- Weak and Strong Convergence of Two Algorithms for the Split Fixed Point Problem
- Convergence analysis of a novel iteration algorithm for solving split feasibility problems
- Title not available (Why is that?)
- Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
- The ball-relaxed gradient-projection algorithm for split feasibility problem
- Strong convergence of iterative algorithms for the split equality problem
- Strong convergence on the split feasibility problem by mixing \(W\)-mapping
- The split feasibility problem with multiple output sets in uniformly convex Banach spaces
- A generalized self-adaptive algorithm for the split feasibility problem in Banach spaces
- The strongly convergent relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- A new algorithm for solving the multiple-sets split feasibility problem in Banach spaces
- The strong convergence of Douglas-Rachford methods for the split feasibility problem
- Strong convergence result of split feasibility problems in Banach spaces
This page was built for publication: Strong convergence of two algorithms for the split feasibility problem in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646522)
