The strong convergence of a three-step algorithm for the split feasibility problem
From MaRDI portal
Publication:360514
DOI10.1007/s11590-012-0506-4zbMath1274.90490OpenAlexW1997815116MaRDI QIDQ360514
Publication date: 27 August 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0506-4
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Programming in abstract spaces (90C48)
Related Items
A novel projection method for split feasibility problems with applications to compressive sensing ⋮ The split feasibility problem and its solution algorithm ⋮ Proximal method of solving split system of minimization problem ⋮ Split Feasibility and Fixed Point Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three-steps iterative algorithms for mixed variational inequalities
- On modified iterative method for nonexpansive mappings and monotone mappings
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- New approximation schemes for general variational inequalities
- Some developments in general variational inequalities
- A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- Iterative Algorithms for Nonlinear Operators
- 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
- FIXED-POINT THEOREMS FOR NONCOMPACT MAPPINGS IN HILBERT SPACE
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Three-step iterative algorithms for multivalued quasi variational inclusions
- Some predictor-corrector algorithms for multivalued variational inequalities
