Modified halfspace-relaxation projection methods for solving the split feasibility problem
From MaRDI portal
Publication:447563
DOI10.1155/2012/483479zbMATH Open1246.65071DBLPjournals/advor/Li12OpenAlexW2164701766WikidataQ58698835 ScholiaQ58698835MaRDI QIDQ447563FDOQ447563
Authors: Min Li
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
Recommendations
- A new halfspace-relaxation projection method for the split feasibility problem
- A novel relaxed projective method for split feasibility problems
- The relaxed inexact projection methods for the split feasibility problem
- A half-space projection algorithm for the split feasibility problem
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
Cites Work
- Convex Analysis
- A multiprojection algorithm using Bregman projections in a product space
- 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
- Title not available (Why is that?)
- The relaxed CQ algorithm solving the split feasibility problem
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A note on the CQ algorithm for the split feasibility problem
- A new halfspace-relaxation projection method for the split feasibility problem
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- On the basic theorem of complementarity
- Minimization of unsmooth functionals
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities
Cited In (5)
- A novel relaxed projective method for split feasibility problems
- A half-space projection algorithm for the split feasibility problem
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A new halfspace-relaxation projection method for the split feasibility problem
- The relaxed inexact projection methods for the split feasibility problem
This page was built for publication: Modified halfspace-relaxation projection methods for solving the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q447563)