full
search.png

Search

close.png

Cancel

arrow
Volume 3, Issue 1
Permanent: Evaluation by Parallel Algorithm

J. Info. Comput. Sci. , 3 (2008), pp. 62-68.

[An open-access article; the PDF is free to any online user.]

Full PDF 159 2423

Cited by

google scholar semantic scholar
Export citation
  • 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.
  • Keywords

Convex feasibility Iterative projection algorithm Armijo-like line search

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JICS-3-62, 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 = {3080-180X}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22785.html} }
TY - JOUR T1 - Permanent: Evaluation by Parallel Algorithm AU - JO - Journal of Information and Computing Science VL - 1 SP - 62 EP - 68 PY - 2008 DA - 2008/03 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.
. (2008). Permanent: Evaluation by Parallel Algorithm. Journal of Information and Computing Science. 3 (1). 62-68. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard