Name
Abstract | ||
|---|---|---|
In this article, we introduce a general splitting method with linearization to solve the split feasibility problem and propose a way of selecting the stepsizes such that the implementation of the method does not need any prior information about the operator norm. We present the constant and adaptive relaxation parameters, and the latter is "optimal" in theory. These ways of selecting stepsizes and relaxation parameters are also practised to the relaxed splitting method with linearization where the two closed convex sets are both level sets of convex functions. The weak convergence of two proposed methods is established under standard conditions and the linear convergence of the general splitting method with linearization is analyzed. The numerical examples are presented to illustrate the advantage of our methods by comparing with other methods. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s10898-020-00963-3 | JOURNAL OF GLOBAL OPTIMIZATION |
Keywords | DocType | Volume |
Split feasibility problem, The general splitting method with linearization, Relaxed splitting method with linearization, CQ algorithm, Linear convergence | Journal | 79 |
Issue | ISSN | Citations |
4 | 0925-5001 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qiao-Li Dong | 1 | 42 | 11.32 |
| Songnian He | 2 | 42 | 8.08 |
| Michael Th. Rassias | 3 | 11 | 5.24 |