On the computation of the step-size for the CQ-like algorithms for the split feasibility problem

In the CQ-like algorithms for the split feasibility problem, in order to get the step-size, one has to compute the largest eigenvalue of the related matrix or use some line search scheme. Our contribution in this short note is to give a simple CQ-like algorithm in which the step-size is directly com...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation Vol. 262; pp. 218 - 223
Main Authors: Qu, Biao, Liu, Binghua, Zheng, Na
Format: Journal Article
Language:English
Published: Elsevier Inc 01.07.2015
Subjects:
CQ-like algorithms
Step-size
The split feasibility problem
The split feasibility problem
CQ-like algorithms
Step-size
ISSN:0096-3003, 1873-5649
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the CQ-like algorithms for the split feasibility problem, in order to get the step-size, one has to compute the largest eigenvalue of the related matrix or use some line search scheme. Our contribution in this short note is to give a simple CQ-like algorithm in which the step-size is directly computed. The algorithm presented in this paper not only need not to compute the largest eigenvalue of the related matrix but also need not to use any line search scheme. The theoretical convergence and numerical results are also given.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2015.04.056