Modified halfspace-relaxation projection methods for solving the split feasibility problem
From MaRDI portal
Publication:447563
DOI10.1155/2012/483479zbMath1246.65071WikidataQ58698835 ScholiaQ58698835MaRDI QIDQ447563
Publication date: 4 September 2012
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/483479
Cites Work
- Unnamed Item
- A multiprojection algorithm using Bregman projections in a product space
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities
- A new halfspace-relaxation projection method for the 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 self-adaptive projection method for solving the multiple-sets split feasibility problem
- A relaxed projection method for variational inequalities
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- The relaxed CQ algorithm solving the split feasibility problem
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Convex Analysis
- On the basic theorem of complementarity
- Minimization of unsmooth functionals
- A note on the CQ algorithm for the split feasibility problem