Projection Algorithm with Line Search for Solving the Convex Feasibility Problem
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{JICS-3-57,
author = {},
title = {Projection Algorithm with Line Search for Solving the Convex Feasibility Problem},
journal = {Journal of Information and Computing Science},
year = {2024},
volume = {3},
number = {1},
pages = {57--61},
abstract = { In this paper, we present a recursive method for solving nonlinear Volterra integral equations.
The proposed method obtains Taylor expansion of the exact solution of Volterra integral equation by using
simple computations. Comparison with other methods proves that the proposed method is very effective and
convenient.
},
issn = {1746-7659},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22784.html}
}
TY - JOUR
T1 - Projection Algorithm with Line Search for Solving the Convex Feasibility Problem
AU -
JO - Journal of Information and Computing Science
VL - 1
SP - 57
EP - 61
PY - 2024
DA - 2024/01
SN - 3
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22784.html
KW - Nonlinear Volterra integral equation of second kind, Numerical method, Taylor expansion.
AB - In this paper, we present a recursive method for solving nonlinear Volterra integral equations.
The proposed method obtains Taylor expansion of the exact solution of Volterra integral equation by using
simple computations. Comparison with other methods proves that the proposed method is very effective and
convenient.
. (2024). Projection Algorithm with Line Search for Solving the Convex Feasibility Problem.
Journal of Information and Computing Science. 3 (1).
57-61.
doi:
Copy to clipboard