New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem

New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem

Abstract Variable stepsize methods are effective for various modified CQ algorithms to solve the split feasibility problem (SFP). The purpose of this paper is first to introduce two new simpler variable stepsizes of the CQ algorithm. Then two new generalized variable stepsizes which can cover the fo...

Full description

Bibliographic Details
Main Authors: Peiyuan Wang, Jianjun Zhou, Risheng Wang, Jie Chen
Format: Article
Language:English
Published: SpringerOpen 2017-06-01
Series:Journal of Inequalities and Applications
Subjects:
split feasibility problem
CQ algorithm
variable stepsize
generalized variable stepsize
Online Access:http://link.springer.com/article/10.1186/s13660-017-1409-9
Description
Summary:Abstract Variable stepsize methods are effective for various modified CQ algorithms to solve the split feasibility problem (SFP). The purpose of this paper is first to introduce two new simpler variable stepsizes of the CQ algorithm. Then two new generalized variable stepsizes which can cover the former ones are also proposed in real Hilbert spaces. And then, two more general KM (Krasnosel’skii-Mann)-CQ algorithms are also presented. Several weak and strong convergence properties are established. Moreover, some numerical experiments have been taken to illustrate the performance of the proposed stepsizes and algorithms.
ISSN:1029-242X

Similar Items