Permanent: Evaluation by Parallel Algorithm
Year: 2008
Journal of Information and Computing Science, Vol. 3 (2008), Iss. 1 : pp. 62–68
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.
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2024-JICS-22785
Journal of Information and Computing Science, Vol. 3 (2008), Iss. 1 : pp. 62–68
Published online: 2008-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 7