|
|
Publication
|
| Title of Article |
An explanation of over-relaxation parameters for some algorithms in Hilbert spaces |
| Date of Acceptance |
21 December 2017 |
| Journal |
| Title of Journal |
Linear and nonlinear analysis |
| Standard |
|
| Institute of Journal |
Yokohama Publ. |
| ISBN/ISSN |
|
| Volume |
|
| Issue |
3 |
| Month |
|
| Year of Publication |
2017 |
| Page |
409-421 |
| Abstract |
Many known algorithms concerning mappings of firmly nonexpansive type have been proposed with the relaxation parameters in the interval [0,2]. Using a fact from theory of nonexpansive mappings, we show that such an over-relaxation can be deduced from the usual relaxation the interval [0,1]. In this paper we discuss a more general form algorithms of the recent works of Chuang and Takahashi [4]. This is inspired by the one studied by Combettes and Pennanen [7]. Finally, we use the same technique to explain the over-relaxation of the contraction-proximal point algorithm of Wang and Cui [17]. |
| Keyword |
nonexpansive mapping, fixed point, maximal monotone operator, over-relaxation parameter, Mann type algorithm, contraction-proximal point algorithm |
| Author |
|
| Reviewing Status |
มีผู้ประเมินอิสระ |
| Status |
ตีพิมพ์แล้ว |
| Level of Publication |
นานาชาติ |
| citation |
false |
| Part of thesis |
true |
| ใช้สำหรับสำเร็จการศึกษา |
ไม่เป็น |
| Attach file |
|
| Citation |
0
|
|
|
|
|
|
|
|
|
Journal Publication
ไทย