On the optimal relaxation parameters of Krasnosel'ski-Mann iteration

This paper is devoted to the optimal selection of the relaxation parameter sequence for Krasnosel'ski-Mann iteration. Firstly, we establish the optimal relaxation parameter sequence of the Krasnosel'ski-Mann iteration, with which the algorithm is proved to achieve the optimal convergence r...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization Ročník 70; číslo 9; s. 1959 - 1986
Hlavní autoři: He, Songnian, Dong, Qiao-Li, Tian, Hanlin, Li, Xiao-Huan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia Taylor & Francis 02.09.2021
Taylor & Francis LLC
Témata:
ISSN:0233-1934, 1029-4945
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract This paper is devoted to the optimal selection of the relaxation parameter sequence for Krasnosel'ski-Mann iteration. Firstly, we establish the optimal relaxation parameter sequence of the Krasnosel'ski-Mann iteration, with which the algorithm is proved to achieve the optimal convergence rate. Then we present an approximation to the optimal relaxation parameter sequence since the optimal relaxation parameter sequence involves fixed points of the operators and can't be used in actual computing. Thirdly, we apply our results to the operators splitting method, such as forward-backward splitting methods and Douglas-Rachford splitting method. Finally, numerical experiments are provided to illustrate that Krasnosel'ski-Mann iteration and the relaxed projected method with our proposed relaxation parameter sequence behave better than others.
AbstractList This paper is devoted to the optimal selection of the relaxation parameter sequence for Krasnosel'ski-Mann iteration. Firstly, we establish the optimal relaxation parameter sequence of the Krasnosel'ski-Mann iteration, with which the algorithm is proved to achieve the optimal convergence rate. Then we present an approximation to the optimal relaxation parameter sequence since the optimal relaxation parameter sequence involves fixed points of the operators and can't be used in actual computing. Thirdly, we apply our results to the operators splitting method, such as forward-backward splitting methods and Douglas-Rachford splitting method. Finally, numerical experiments are provided to illustrate that Krasnosel'ski-Mann iteration and the relaxed projected method with our proposed relaxation parameter sequence behave better than others.
Author He, Songnian
Dong, Qiao-Li
Li, Xiao-Huan
Tian, Hanlin
Author_xml – sequence: 1
  givenname: Songnian
  surname: He
  fullname: He, Songnian
  organization: Tianjin Key Laboratory for Advanced Signal Processing and College of Science, Civil Aviation University of China
– sequence: 2
  givenname: Qiao-Li
  orcidid: 0000-0001-6765-4437
  surname: Dong
  fullname: Dong, Qiao-Li
  email: dongql@lsec.cc.ac.cn
  organization: Tianjin Key Laboratory for Advanced Signal Processing and College of Science, Civil Aviation University of China
– sequence: 3
  givenname: Hanlin
  surname: Tian
  fullname: Tian, Hanlin
  organization: Tianjin Key Laboratory for Advanced Signal Processing and College of Science, Civil Aviation University of China
– sequence: 4
  givenname: Xiao-Huan
  surname: Li
  fullname: Li, Xiao-Huan
  organization: Tianjin Key Laboratory for Advanced Signal Processing and College of Science, Civil Aviation University of China
BookMark eNqFkEtLAzEUhYNUsK3-BGHAhaupec0juFHqEyvd6DqkmQRTp8mYpGj_vZm2blwoXLhw73fu5ZwRGFhnFQCnCE4QrOEFxIQgRugEQ5xGVVkhiA7AEEHMcspoMQDDnsl76AiMQlhCiFGJ6RDczG0W31TmumhWos28asWXiMbZrBNerFRUPmROZ09eBOuCas_Du8mfhbWZSbstegwOtWiDOtn3MXi9u32ZPuSz-f3j9HqWS0LqmAstqW4kRoLJBhW0xExqVpeIUQI1FRXGuknDWsGKoUXdwFqXUhblgsFUiIzB2e5u593HWoXIl27tbXrJcVHWlBVVjRNV7CjpXQhead755M1vOIK8D4z_BMb7wPg-sKS7_KWTJm79RS9M-6_6aqc2Vju_Ep_Otw2PYtM6r72w0gRO_j7xDVR5hQA
CitedBy_id crossref_primary_10_1007_s11784_021_00879_9
crossref_primary_10_1090_mcom_3851
crossref_primary_10_1080_02331934_2024_2341942
Cites_doi 10.1007/s11228-017-0421-z
10.1007/s11856-018-1723-z
10.1016/0022-247X(79)90024-6
10.1007/s10957-011-9837-z
10.1007/s11075-015-0085-4
10.1017/CBO9780511526152
10.1016/j.jmaa.2014.11.044
10.1007/s10444-011-9254-8
10.1007/BF01581204
10.1007/978-3-319-48311-5
10.1016/j.na.2005.05.059
10.1007/s11856-013-0045-4
10.1007/BF01190119
10.1016/j.cam.2007.07.021
10.1215/S0012-7094-62-02933-2
10.1080/02331930412331327157
10.1137/0716071
10.1016/j.amc.2015.01.017
10.1081/NFA-120003674
10.1007/s10107-015-0964-4
10.1007/s10107-018-1240-1
10.1007/s10898-018-0727-x
10.1007/s10957-019-01542-7
10.1090/S0002-9947-1956-0084194-4
10.1007/978-3-319-89815-5_7
10.1080/10556788.2017.1396601
10.1016/j.na.2004.11.011
10.1007/s10898-017-0506-0
10.1109/ICIP.2014.7025841
10.1017/S000497271600109X
10.1007/s10107-014-0805-x
10.11650/twjm/1500405126
10.1109/78.330356
10.1090/mcom/2965
10.1007/s11590-016-1102-9
10.1016/j.amc.2010.10.039
10.1016/j.na.2006.08.036
10.1112/S0024610702003332
10.1201/b16485
10.1090/S0002-9939-1953-0054846-3
ContentType Journal Article
Copyright 2020 Informa UK Limited, trading as Taylor & Francis Group 2020
2020 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2020 Informa UK Limited, trading as Taylor & Francis Group 2020
– notice: 2020 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
DOI 10.1080/02331934.2020.1767101
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
Aerospace Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Aerospace Database
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Aerospace Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1029-4945
EndPage 1986
ExternalDocumentID 10_1080_02331934_2020_1767101
1767101
Genre Research Article
GroupedDBID .7F
.DC
.QJ
0BK
0R~
123
29N
30N
4.4
5VS
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACIWK
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMVHM
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DKSSO
DU5
EBS
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
NA5
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
AAYXX
CITATION
7SC
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c338t-afc4fdc21a9cd154629cf98619430f4a722fd6298e0791b8d08f6cc56b90b9013
IEDL.DBID TFW
ISICitedReferencesCount 9
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000537569100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0233-1934
IngestDate Wed Aug 13 04:21:24 EDT 2025
Sat Nov 29 06:01:41 EST 2025
Tue Nov 18 22:22:07 EST 2025
Mon Oct 20 23:48:11 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 9
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c338t-afc4fdc21a9cd154629cf98619430f4a722fd6298e0791b8d08f6cc56b90b9013
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-6765-4437
PQID 2568495782
PQPubID 27961
PageCount 28
ParticipantIDs crossref_primary_10_1080_02331934_2020_1767101
informaworld_taylorfrancis_310_1080_02331934_2020_1767101
proquest_journals_2568495782
crossref_citationtrail_10_1080_02331934_2020_1767101
PublicationCentury 2000
PublicationDate 2021-09-02
PublicationDateYYYYMMDD 2021-09-02
PublicationDate_xml – month: 09
  year: 2021
  text: 2021-09-02
  day: 02
PublicationDecade 2020
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle Optimization
PublicationYear 2021
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References CIT0030
CIT0010
CIT0032
CIT0031
CIT0012
CIT0034
CIT0011
CIT0033
Aubin JP (CIT0041) 1990
CIT0014
CIT0036
CIT0013
CIT0035
CIT0016
CIT0038
CIT0037
CIT0018
CIT0017
CIT0039
CIT0019
CIT0040
CIT0021
CIT0043
CIT0020
CIT0042
CIT0001
CIT0023
CIT0045
CIT0022
CIT0044
Lions PL. (CIT0015) 1977; 284
CIT0003
CIT0025
CIT0002
CIT0024
CIT0005
CIT0027
CIT0004
CIT0026
CIT0029
CIT0006
CIT0028
CIT0009
Krasnosel'ski MA. (CIT0007) 1955; 10
CIT0008
References_xml – volume-title: Set-valued analysis
  year: 1990
  ident: CIT0041
– ident: CIT0005
  doi: 10.1007/s11228-017-0421-z
– ident: CIT0023
  doi: 10.1007/s11856-018-1723-z
– ident: CIT0016
  doi: 10.1016/0022-247X(79)90024-6
– ident: CIT0045
  doi: 10.1007/s10957-011-9837-z
– ident: CIT0043
  doi: 10.1007/s11075-015-0085-4
– ident: CIT0032
  doi: 10.1017/CBO9780511526152
– ident: CIT0031
  doi: 10.1016/j.jmaa.2014.11.044
– ident: CIT0003
  doi: 10.1007/s10444-011-9254-8
– ident: CIT0040
  doi: 10.1007/BF01581204
– ident: CIT0021
  doi: 10.1007/978-3-319-48311-5
– ident: CIT0013
  doi: 10.1016/j.na.2005.05.059
– ident: CIT0022
  doi: 10.1007/s11856-013-0045-4
– ident: CIT0018
  doi: 10.1007/BF01190119
– ident: CIT0026
  doi: 10.1016/j.cam.2007.07.021
– ident: CIT0042
  doi: 10.1215/S0012-7094-62-02933-2
– ident: CIT0004
– ident: CIT0033
  doi: 10.1080/02331930412331327157
– ident: CIT0002
  doi: 10.1137/0716071
– ident: CIT0027
  doi: 10.1016/j.amc.2015.01.017
– ident: CIT0034
  doi: 10.1081/NFA-120003674
– ident: CIT0014
  doi: 10.1007/s10107-015-0964-4
– ident: CIT0024
  doi: 10.1007/s10107-018-1240-1
– ident: CIT0029
  doi: 10.1007/s10898-018-0727-x
– ident: CIT0039
– ident: CIT0017
  doi: 10.1007/s10957-019-01542-7
– ident: CIT0001
  doi: 10.1090/S0002-9947-1956-0084194-4
– ident: CIT0028
  doi: 10.1007/978-3-319-89815-5_7
– ident: CIT0011
  doi: 10.1080/10556788.2017.1396601
– ident: CIT0012
  doi: 10.1016/j.na.2004.11.011
– ident: CIT0044
  doi: 10.1007/s10898-017-0506-0
– ident: CIT0037
  doi: 10.1109/ICIP.2014.7025841
– ident: CIT0025
  doi: 10.1017/S000497271600109X
– ident: CIT0006
  doi: 10.1007/s10107-014-0805-x
– ident: CIT0020
  doi: 10.11650/twjm/1500405126
– ident: CIT0030
  doi: 10.1109/78.330356
– ident: CIT0038
  doi: 10.1090/mcom/2965
– volume: 10
  start-page: 123
  year: 1955
  ident: CIT0007
  publication-title: Usp Mat Nauk
– ident: CIT0009
  doi: 10.1007/s11590-016-1102-9
– ident: CIT0010
  doi: 10.1016/j.amc.2010.10.039
– ident: CIT0035
  doi: 10.1016/j.na.2006.08.036
– ident: CIT0019
  doi: 10.1112/S0024610702003332
– ident: CIT0036
  doi: 10.1201/b16485
– volume: 284
  start-page: 1357
  year: 1977
  ident: CIT0015
  publication-title: Acad Sci Series A-B Paris
– ident: CIT0008
  doi: 10.1090/S0002-9939-1953-0054846-3
SSID ssj0021624
Score 2.292761
Snippet This paper is devoted to the optimal selection of the relaxation parameter sequence for Krasnosel'ski-Mann iteration. Firstly, we establish the optimal...
This paper is devoted to the optimal selection of the relaxation parameter sequence for Krasnosel'ski–Mann iteration. Firstly, we establish the optimal...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1959
SubjectTerms Algorithms
averaged mapping
Douglas-Rachford splitting algorithm
Fixed points (mathematics)
forward-backward splitting algorithm
Iterative methods
Krasnosel'ski-Mann iteration
nonexpansive mapping
Operators
optimal relaxation parameter
Parameters
Splitting
Title On the optimal relaxation parameters of Krasnosel'ski-Mann iteration
URI https://www.tandfonline.com/doi/abs/10.1080/02331934.2020.1767101
https://www.proquest.com/docview/2568495782
Volume 70
WOSCitedRecordID wos000537569100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor and Francis Online Journals
  customDbUrl:
  eissn: 1029-4945
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021624
  issn: 0233-1934
  databaseCode: TFW
  dateStart: 19850101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5SPOjBt1itsgfBU3STbHc3R1GLoFQPFXsLSXYDxXZXulX8-c7so7SI9KCwp5AJy0yS-SaZfEPIeWCCbpBwQR3nEQ2M1lQmoaFCJ0wLwSwT5UPhx6jfj4dD-VxnExZ1WiXG0K4iiij3alzc2hRNRtwVuBmYOAJPRDg0RSF4SQyAANljUt-g9zoPuVhYlrVFCYoizRue30ZZ8k5L3KU_9urSAfW2_-HXd8hWjT6962q67JK1NNsjmwuchPvk9inzABR6OewlE-iLj12-SvN5SBM-wfSZwsud9zDVRZYX6fiieBtRLLbsVRTN0PWAvPTuBjf3tC61QC3EqDOqnQ1cYjnT0iaAqkIurZMxHnEI3wU64twl0BinfiSZiRM_dqG13dBIHz4mDkkry7P0iHhRLFPAAU7zVAcsNRAPWuNH3OAFL5e6TYJGxcrWPORYDmOsWENXWitJoZJUraQ2uZyLvVdEHKsE5KL91Kw8AXFVuRIlVsh2GmOrek0XCsBhDOEkQKrjPwx9QjY4psXgnRTvkNZs-pGeknX7ORsV07Ny9n4DUkPoQg
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dS8MwEA-igvrgtzid2gfBp2iTdG3zKOqYbM6XiXsLadrAcOtkneKf710_xobIHhT6FHKh3CW5j9z9jpBLL_IaXswFtZwH1Iu0pjL2Iyp0zLQQzDCRFwp3gm437PflfC0MplWiD20LoIj8rsbDjcHoKiXuBvQM7ByBIREOQ4EPahI8oDXsTocOWK_5OnO6mJ83tkUSijRVFc9vyyzopwX00h-3da6Cmjv_8fO7ZLs0QJ3bYsfskZUk3Sdbc7CEB-T-OXXALnTGcJ2MYC7Wu3zlEnQQKXyEGTSZM7ZOe6KzdJwlw6vsbUCx37JToDTD1EPy0nzo3bVo2W2BGnBTp1Rb49nYcKalicGw8rk0VoYY5RCu9XTAuY1hMEzcQLIojN3Q-sY0_Ei68DFxRFbTcZocEycIZQKmgNU80R5LInAJTeQGPMI3Xi51jXgVj5UpocixI8ZQsQqxtGSSQiapkkk1cj0jey-wOJYRyHkBqmkeBLFFxxIlltDWK2mr8lhnCuzDEDxKsKpO_rD0Bdlo9Z46qvPYbZ-STY5ZMvhExetkdTr5SM7IuvmcDrLJeb6VvwEMQ-xl
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NS8MwFA8yRfTgtzid2oPgKdokXdscxVmUjbnDxN1CmjYw3NqxVvHP96UfsiGyg0JPIS-Ul5e830tefg-hKyd02k5EGdaUetgJpcQ8ckPMZEQkY0QRVjwU7nn9vj8a8UGVTZhVaZUmhtYlUUSxV5vFPYt0nRF3C24GDIeZExEKTZ4LXhICoHWAzm1j2MPg9TvmIm5R19aIYCNTP-L5bZgl97REXvpjsy48ULD7D_--h3Yq-Gndlfayj9bi5ABtL5ASHqLOc2IBKrRS2Eym0Ne8dvks5s8yPOFTkz-TWam2unOZJWkWT66ztzE21ZatkqMZuh6hl-BheP-Iq1oLWEGQmmOplaMjRYnkKgJY5VKuNPfNGQeztSM9SnUEjX5se5yEfmT72lWq7Ybcho-wY9RI0iQ-QZbn8xiAgJY0lg6JQwgIVWh7NDQ3vJTLJnJqFQtVEZGbehgTQWq-0kpJwihJVEpqoptvsVnJxLFKgC_On8iLIxBd1isRbIVsq55sUS3qTAA69CGeBEx1-oehL9HmoBOI3lO_e4a2qEmRMfdTtIUa-fw9Pkcb6iMfZ_OLwpC_AEVn6xc
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+optimal+relaxation+parameters+of+Krasnosel%27ski-Mann+iteration&rft.jtitle=Optimization&rft.au=He%2C+Songnian&rft.au=Dong%2C+Qiao-Li&rft.au=Tian%2C+Hanlin&rft.au=Li%2C+Xiao-Huan&rft.date=2021-09-02&rft.pub=Taylor+%26+Francis&rft.issn=0233-1934&rft.eissn=1029-4945&rft.volume=70&rft.issue=9&rft.spage=1959&rft.epage=1986&rft_id=info:doi/10.1080%2F02331934.2020.1767101&rft.externalDocID=1767101
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0233-1934&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0233-1934&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0233-1934&client=summon