TY - JOUR
T1 - Permanent: Evaluation by Parallel Algorithm
AU - 
JO - Journal of Information and Computing Science
VL - 1
SP - 62
EP - 68
PY - 2024
DA - 2024/01
SN - 3
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22785.html
KW - Convex feasibility
KW -  Iterative projection algorithm
KW -  Armijo-like line search 

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