A preconditioning method of the CQ algorithm for solving an extended split feasibility problem
From MaRDI portal
Publication:2405616
DOI10.1186/1029-242X-2014-163zbMath1469.65112OpenAlexW2123524545WikidataQ59323715 ScholiaQ59323715MaRDI QIDQ2405616
Publication date: 26 September 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1029-242x-2014-163
relaxed methodpreconditioning methodapproximate variable preconditionerextended split feasibility problem
Related Items (2)
Preconditioning methods for solving a general split feasibility problem ⋮ The split feasibility problems in an infinite dimensional space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The relaxed inexact projection methods for the split feasibility problem
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- On descent-projection method for solving the split feasibility problems
- Solving the split feasibility problem without prior knowledge of matrix norms
- Theory and Methods Related to the Singular-Function Expansion and Landweber’s Iteration for Integral Equations of the First Kind
- Projected Landweber method and preconditioning
- 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
- Iterative projection onto convex sets using multiple Bregman distances
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
This page was built for publication: A preconditioning method of the CQ algorithm for solving an extended split feasibility problem
