Inertial accelerated algorithms for solving a split feasibility problem
Inspired by the inertial proximal algorithms for finding a zero of a maximal monotone operator, in this paper, we propose two inertial accel erated algorithms to solve the split feasibility problem. One is an inertial relaxed-CQ algorithm constructed by applying inertial technique to a relaxed- CQ a...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
American Institute of Mathematical Sciences
2017
|
| Online Access: | http://purl.org/au-research/grants/arc/DP160102819 http://hdl.handle.net/20.500.11937/56140 |
| _version_ | 1848759796511014912 |
|---|---|
| author | Dang, Y. Sun, Jie Xu, Honglei |
| author_facet | Dang, Y. Sun, Jie Xu, Honglei |
| author_sort | Dang, Y. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Inspired by the inertial proximal algorithms for finding a zero of a maximal monotone operator, in this paper, we propose two inertial accel erated algorithms to solve the split feasibility problem. One is an inertial relaxed-CQ algorithm constructed by applying inertial technique to a relaxed- CQ algorithm, the other is a modified inertial relaxed-CQ algorithm which combines the KM method with the inertial relaxed-CQ algorithm. We prove their asymptotical convergence under some suitable conditions. Numerical re sults are reported to show the effectiveness of the proposed algorithms. |
| first_indexed | 2025-11-14T10:05:35Z |
| format | Journal Article |
| id | curtin-20.500.11937-56140 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:05:35Z |
| publishDate | 2017 |
| publisher | American Institute of Mathematical Sciences |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-561402022-10-27T04:42:01Z Inertial accelerated algorithms for solving a split feasibility problem Dang, Y. Sun, Jie Xu, Honglei Inspired by the inertial proximal algorithms for finding a zero of a maximal monotone operator, in this paper, we propose two inertial accel erated algorithms to solve the split feasibility problem. One is an inertial relaxed-CQ algorithm constructed by applying inertial technique to a relaxed- CQ algorithm, the other is a modified inertial relaxed-CQ algorithm which combines the KM method with the inertial relaxed-CQ algorithm. We prove their asymptotical convergence under some suitable conditions. Numerical re sults are reported to show the effectiveness of the proposed algorithms. 2017 Journal Article http://hdl.handle.net/20.500.11937/56140 10.3934/jimo.2016078 http://purl.org/au-research/grants/arc/DP160102819 American Institute of Mathematical Sciences fulltext |
| spellingShingle | Dang, Y. Sun, Jie Xu, Honglei Inertial accelerated algorithms for solving a split feasibility problem |
| title | Inertial accelerated algorithms for solving a split feasibility problem |
| title_full | Inertial accelerated algorithms for solving a split feasibility problem |
| title_fullStr | Inertial accelerated algorithms for solving a split feasibility problem |
| title_full_unstemmed | Inertial accelerated algorithms for solving a split feasibility problem |
| title_short | Inertial accelerated algorithms for solving a split feasibility problem |
| title_sort | inertial accelerated algorithms for solving a split feasibility problem |
| url | http://purl.org/au-research/grants/arc/DP160102819 http://hdl.handle.net/20.500.11937/56140 |