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

Biao Qu, Binghua Liu and Na Zheng

Applied Mathematics and Computation, 2015, vol. 262, issue C, 218-223

Abstract: 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.

Keywords: CQ-like algorithms; The split feasibility problem; Step-size (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315005147
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:262:y:2015:i:c:p:218-223

DOI: 10.1016/j.amc.2015.04.056

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().