Modified halfspace-relaxation projection methods for solving the split feasibility problem

DOI10.1155/2012/483479MaRDI QIDQ447563zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Min Li

Publication date 4 September 2012

Published in Advances in Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/483479

Mathematics Subject Classification ID

Review text

Summary: This paper presents modified halfspace-relaxation projection (HRP) methods for solving the split feasibility problem (SFP). Incorporating with the techniques of identifying the optimal step length with positive lower bounds, the new methods improve the efficiencies of the HRP method [\textit{B. Qu} and \textit{N. Xiu}, Linear Algebra Appl. 428, No. 5--6, 1218--1229 (2008; Zbl 1135.65022)]. Some numerical results are reported to verify the computational preference.

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

• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A multiprojection algorithm using Bregman projections in a product space
• A new halfspace-relaxation projection method for the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• A relaxed projection method for variational inequalities
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Comparison of two kinds of prediction-correction methods for monotone variational inequalities
• Convex Analysis
• scientific article; zbMATH DE number 3534286 (Why is no real title available?)
• Minimization of unsmooth functionals
• Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
• On the basic theorem of complementarity
• The multiple-sets split feasibility problem and its applications for inverse problems
• The relaxed CQ algorithm solving the split feasibility problem

Cited in

(5)

• A new halfspace-relaxation projection method for the split feasibility problem
• A half-space projection algorithm for the split feasibility problem
• A novel relaxed projective method for split feasibility problems
• The relaxed inexact projection methods for the split feasibility problem
• ``Optimal choice of the step length of the projection and contraction methods for solving 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)