An inertial triple-projection algorithm for solving the split feasibility problems
This paper proposes a new inertial triple-projection algorithm for solving the split feasibility problem (SFP).The process of projections is divided into three parts. Each part adopts a different variable stepsize to obtain its projection point, which is different from the existing extragradient met...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2023
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/7132 https://ink.library.smu.edu.sg/context/lkcsb_research/article/8131/viewcontent/10.3934_jimo.2022019.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | This paper proposes a new inertial triple-projection algorithm for solving the split feasibility problem (SFP).The process of projections is divided into three parts. Each part adopts a different variable stepsize to obtain its projection point, which is different from the existing extragradient methods. Flexible rules are employed for selecting the stepsizes and the inertial technique is used for improving the convergence. Convergence results are proven. Numerical experiments show that the proposed method converges more quickly than the general CQ algorithm. |
|---|