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 |
| Summary: | 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. |
|---|