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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematics and computation Ročník 262; s. 218 - 223
Hlavní autoři: Qu, Biao, Liu, Binghua, Zheng, Na
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.07.2015
Témata:
CQ-like algorithms
Step-size
The split feasibility problem
The split feasibility problem
CQ-like algorithms
Step-size
ISSN:0096-3003, 1873-5649
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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