2022
DOI: 10.1016/j.matcom.2021.12.007
|View full text |Cite
|
Sign up to set email alerts
|

Inertial viscosity-type iterative method for solving inclusion problems with applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 22 publications
0
11
0
Order By: Relevance
“…Author details 1 Mathematics Institute, African University of Science and Technology, Abuja 900107, Nigeria. 2 Center of Excellence in Theoretical and Computational Science (TaCS-CoE), Science Laboratory Building, Faculty of Science, King Mongkut's University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thung Khru, Bangkok 10140, Thailand. 3 Department of Mathematics, Faculty of Science and Technology, Rambhai Barni Rajabhat University, Chanthaburi 22000, Thailand.…”
Section: Fundingmentioning
confidence: 99%
See 1 more Smart Citation
“…Author details 1 Mathematics Institute, African University of Science and Technology, Abuja 900107, Nigeria. 2 Center of Excellence in Theoretical and Computational Science (TaCS-CoE), Science Laboratory Building, Faculty of Science, King Mongkut's University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thung Khru, Bangkok 10140, Thailand. 3 Department of Mathematics, Faculty of Science and Technology, Rambhai Barni Rajabhat University, Chanthaburi 22000, Thailand.…”
Section: Fundingmentioning
confidence: 99%
“…The vast applicability of the monotone inclusion problem (1) in solving problems such as convex minimization, variational inequality, image restoration, and signal processing has made it a problem of contemporary interest (see, e.g., [1][2][3][4][5]). Many mathematical algorithms have been developed for solving problem (1).…”
Section: Introductionmentioning
confidence: 99%
“…Iterative algorithms for approximating solutions of the inclusion (1.1) have been studied extensively by numerous authors (see, e.g., [1][2][3] [11], [12], [13], [14] [15], [16]). Assuming existence of solution, one of the classical methods for approximating solution(s) of (1.1) in the setting of real Hilbert spaces is the well-known forward-backward algorithm (FBA) which is an iterative procedure that starts at a point x 1 ∈ H, and generates inductively the sequence {x n } ⊂ H by:…”
Section: Introductionmentioning
confidence: 99%
“…Moudafi and Oliny [15] in 2003 introduced the inertial proximal algorithm to solve the problem (1.1), which was developed from the forwardbackward splitting algorithm with the inertial extrapolation technique. Some very recent results on the modified forward-backward splitting method have also been in [1,5,6,14]. Many real-world problems necessitate finding a solution that satisfies several constraints.…”
Section: Introductionmentioning
confidence: 99%