Article ID Journal Published Year Pages File Type
4626730 Applied Mathematics and Computation 2015 6 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Authors
, , ,