@Article{JICS-3-1,
author = {},
title = {Permanent: Evaluation by Parallel Algorithm},
journal = {Journal of Information and Computing Science},
year = {2008},
volume = {3},
number = {1},
pages = {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. 
},
issn = {1746-7659},
doi = {https://doi.org/2024-JICS-22785},
url = {https://global-sci.com/article/87516/permanent-evaluation-by-parallel-algorithm}
}