Journal
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
Volume 13, Issue 3, Pages 1383-1394Publisher
AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/jimo.2016078
Keywords
Asymptotical convergence; inertial technique; nonsmooth analysis; split feasibility problem; subdifferential
Categories
Funding
- Natural Science Foundation of Shanghai [14ZR1429200]
- Innovation Program of Shanghai Municipal Education Commission [15ZZ074]
- Australian Research Council [DP160102819]
Ask authors/readers for more resources
Inspired by the inertial proximal algorithms for finding a zero of a maximal monotone operator, in this paper, we propose two inertial accelerated 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 results are reported to show the effectiveness of the proposed algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available