Permanent: Evaluation by Parallel Algorithm

Abstract

An iterative projection algorithm by adopting Armijo-like line search to solve the convex feasibility problem (CFP) is presented and the convergence is shown under some conditions. Moreover, as a by-product, the unfixed stepsize factor is not confined to the interval (0, 2). A numerical test is listed and the results generated are really impressive, which indicate the line search method is promising.