Gradient methods with selection technique for the multiple-sets split feasibility problem

In this paper, we present two new iterative algorithms for approximating a solution of the multiple-sets split feasibility problem. The suggested algorithms are based on the gradient method with selection technique. Weak and strong convergence theorems are demonstrated.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization Jg. 69; H. 2; S. 269 - 281
Hauptverfasser: Yao, Yonghong, Postolache, Mihai, Zhu, Zhichuan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Philadelphia Taylor & Francis 01.02.2020
Taylor & Francis LLC
Schlagworte:
Algorithms
Feasibility
gradient method
iterative algorithm
Iterative algorithms
Multiple-sets split feasibility problem
projection
ISSN:0233-1934, 1029-4945
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In this paper, we present two new iterative algorithms for approximating a solution of the multiple-sets split feasibility problem. The suggested algorithms are based on the gradient method with selection technique. Weak and strong convergence theorems are demonstrated.
AbstractList In this paper, we present two new iterative algorithms for approximating a solution of the multiple-sets split feasibility problem. The suggested algorithms are based on the gradient method with selection technique. Weak and strong convergence theorems are demonstrated.
Author Postolache, Mihai
Zhu, Zhichuan
Yao, Yonghong
Author_xml – sequence: 1
  givenname: Yonghong
  surname: Yao
  fullname: Yao, Yonghong
  organization: School of Mathematics and Information Science, North Minzu University
– sequence: 2
  givenname: Mihai
  surname: Postolache
  fullname: Postolache, Mihai
  email: emscolar@yahoo.com
  organization: Department of Mathematics and Informatics, University "Politehnica" of Bucharest
– sequence: 3
  givenname: Zhichuan
  surname: Zhu
  fullname: Zhu, Zhichuan
  organization: School of Economics, Liaoning University
BookMark eNqFkE9LxDAQxYOs4K76EYSA567517TFi7LoKix40YOnkKYJzZI2Ncmy7Le3ZdeLBz3NMLz3Zua3ALPe9xqAG4yWGJXoDhFKcUXZkiBcLTFHpCjIGZhjRKqMVSyfgfmkySbRBVjEuEWIYE7YHHyug2ys7hPsdGp9E-HephZG7bRK1vcwadX29munofEBplbDbueSHZzOok4RxsHZBI2W0dZ2bA9wCL52ursC50a6qK9P9RJ8PD-9r16yzdv6dfW4yRSlZcoKVfHaEFLLmjEjCa1ZSXPO2TjU2JiKGcO5KvKKSsMNlnVDS6k4LYgpeGnoJbg95o57xzNjElu_C_24UhCaE0x4idiouj-qVPAxBm2EsklOH6YgrRMYiYml-GEpJpbixHJ057_cQ7CdDId_fQ9Hn-1Hep3c--AakeTB-WCC7JWNgv4d8Q36GI5x
CitedBy_id crossref_primary_10_1080_02331934_2020_1808648
crossref_primary_10_1007_s11075_022_01343_6
crossref_primary_10_1186_s13660_020_02508_4
crossref_primary_10_3390_sym11121517
crossref_primary_10_1080_02331934_2023_2244174
crossref_primary_10_3390_sym11060811
crossref_primary_10_1080_02331934_2022_2094266
crossref_primary_10_3390_math7121189
crossref_primary_10_1007_s12190_024_02008_4
crossref_primary_10_3390_math7090773
crossref_primary_10_3390_math7020145
crossref_primary_10_3390_axioms10030152
crossref_primary_10_1080_02331934_2020_1834557
crossref_primary_10_3390_sym12060902
crossref_primary_10_1155_2022_9447175
crossref_primary_10_3390_math7100928
crossref_primary_10_1007_s11081_025_10023_y
crossref_primary_10_1186_s13660_019_2243_z
crossref_primary_10_1007_s40314_023_02416_5
crossref_primary_10_1080_02331934_2023_2240347
crossref_primary_10_3934_jimo_2025126
crossref_primary_10_1080_01630563_2022_2084753
crossref_primary_10_1080_02331934_2021_1939341
crossref_primary_10_3390_math10193617
crossref_primary_10_1080_02331934_2023_2181081
crossref_primary_10_3390_sym12101676
crossref_primary_10_1007_s12190_020_01358_z
crossref_primary_10_1155_2021_2218666
crossref_primary_10_1007_s43034_022_00190_9
crossref_primary_10_3390_sym12040608
crossref_primary_10_1080_02331934_2020_1858832
crossref_primary_10_3390_sym11050655
Cites_doi 10.1088/0266-5611/18/2/310
10.1088/0266-5611/26/5/055007
10.1017/CBO9780511526152
10.1186/1687-1812-2014-183
10.1007/BF02142692
10.1287/moor.26.2.248.10558
10.1007/s11075-017-0282-4
10.1088/0266-5611/21/6/017
10.1080/02331934.2017.1390747
10.1137/S0036144593251710
10.1186/1687-1812-2013-201
10.1007/s10898-018-0628-z
10.1007/s11784-018-0549-y
10.22436/jnsa.010.02.43
10.1186/s13660-018-1799-3
10.24193/fpt-ro.2019.1.16
10.24193/fpt-ro.2018.2.52
10.37193/CJM.2018.03.23
10.2298/FIL1612243D
10.1016/j.jmaa.2014.01.068
10.1088/0266-5611/22/6/007
10.1186/s13663-015-0376-4
10.1080/02331934.2018.1491973
10.1016/j.na.2011.03.044
10.1007/s10957-014-0662-z
10.1080/01630563.2016.1185614
10.22436/jnsa.009.06.58
10.1080/02331934.2014.895898
10.1088/0031-9155/51/10/001
10.23952/jnva.2.2018.1.05
10.1080/02331934.2017.1396603
10.1186/s13660-015-0576-9
10.1112/S0024610702003332
ContentType Journal Article
Copyright 2019 Informa UK Limited, trading as Taylor & Francis Group 2019
2019 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2019 Informa UK Limited, trading as Taylor & Francis Group 2019
– notice: 2019 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.2019.1602772
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 281
ExternalDocumentID 10_1080_02331934_2019_1602772
1602772
Genre Article
GrantInformation_xml – fundername: Jilin Provincial Science and Technology Development
  grantid: 20170520050JH
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-7c96bf22bab44fa23b4835664bf2e1ff94ff66c7593af6f1abd38ac6372f768f3
IEDL.DBID TFW
ISICitedReferencesCount 88
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000508986900004&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 01:44:26 EDT 2025
Sat Nov 29 06:01:41 EST 2025
Tue Nov 18 22:37:09 EST 2025
Mon Oct 20 23:49:19 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c338t-7c96bf22bab44fa23b4835664bf2e1ff94ff66c7593af6f1abd38ac6372f768f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2352126804
PQPubID 27961
PageCount 13
ParticipantIDs informaworld_taylorfrancis_310_1080_02331934_2019_1602772
crossref_citationtrail_10_1080_02331934_2019_1602772
crossref_primary_10_1080_02331934_2019_1602772
proquest_journals_2352126804
PublicationCentury 2000
PublicationDate 2/1/2020
2020-02-01
20200201
PublicationDateYYYYMMDD 2020-02-01
PublicationDate_xml – month: 02
  year: 2020
  text: 2/1/2020
  day: 01
PublicationDecade 2020
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle Optimization
PublicationYear 2020
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References Ceng LC (CIT0041) 2015; 16
CIT0030
CIT0010
CIT0032
CIT0031
CIT0012
CIT0034
CIT0011
Takahashi W (CIT0024) 2017; 1
Censor Y (CIT0003) 2009; 16
Yao Y (CIT0026) 2018; 80
CIT0014
Yao Y (CIT0027) 2017; 18
CIT0036
CIT0013
CIT0035
Yao YH (CIT0042) 2018; 19
CIT0016
CIT0015
CIT0037
CIT0018
CIT0017
CIT0019
Yao YH (CIT0038) 2018; 11
CIT0040
CIT0021
Takahashi W. (CIT0033) 2014; 15
CIT0043
CIT0020
CIT0001
CIT0023
Xu HK (CIT0039) 2017; 18
CIT0045
CIT0022
CIT0044
Takahashi W. (CIT0007) 2016; 17
CIT0002
Cho SY (CIT0004) 2018; 19
CIT0005
Yao YH (CIT0008) 2018; 34
Qin X (CIT0025) 2017; 18
CIT0029
CIT0006
CIT0028
CIT0009
References_xml – ident: CIT0031
  doi: 10.1088/0266-5611/18/2/310
– volume: 19
  start-page: 407
  year: 2018
  ident: CIT0042
  publication-title: J Nonlinear Convex Anal
– ident: CIT0006
  doi: 10.1088/0266-5611/26/5/055007
– ident: CIT0043
  doi: 10.1017/CBO9780511526152
– ident: CIT0016
  doi: 10.1186/1687-1812-2014-183
– ident: CIT0029
  doi: 10.1007/BF02142692
– volume: 11
  start-page: 1959
  year: 2018
  ident: CIT0038
  publication-title: J Nonlinear Convex Anal
– ident: CIT0044
  doi: 10.1287/moor.26.2.248.10558
– volume: 17
  start-page: 1051
  year: 2016
  ident: CIT0007
  publication-title: J Nonlinear Convex Anal
– ident: CIT0014
  doi: 10.1007/s11075-017-0282-4
– ident: CIT0001
  doi: 10.1088/0266-5611/21/6/017
– ident: CIT0011
  doi: 10.1080/02331934.2017.1390747
– ident: CIT0030
  doi: 10.1137/S0036144593251710
– ident: CIT0018
  doi: 10.1186/1687-1812-2013-201
– ident: CIT0021
  doi: 10.1007/s10898-018-0628-z
– volume: 1
  start-page: 423
  year: 2017
  ident: CIT0024
  publication-title: Appl Anal Optim
– volume: 18
  start-page: 875
  year: 2017
  ident: CIT0027
  publication-title: J Nonlinear Convex Anal
– ident: CIT0037
  doi: 10.1007/s11784-018-0549-y
– volume: 19
  start-page: 251
  year: 2018
  ident: CIT0004
  publication-title: J Nonlinear Convex Anal
– ident: CIT0017
  doi: 10.22436/jnsa.010.02.43
– volume: 15
  start-page: 1349
  year: 2014
  ident: CIT0033
  publication-title: J Nonlinear Convex Anal
– ident: CIT0036
  doi: 10.1186/s13660-018-1799-3
– ident: CIT0009
  doi: 10.24193/fpt-ro.2019.1.16
– ident: CIT0022
  doi: 10.24193/fpt-ro.2018.2.52
– volume: 34
  start-page: 459
  year: 2018
  ident: CIT0008
  publication-title: Carpathian J Math
  doi: 10.37193/CJM.2018.03.23
– ident: CIT0015
  doi: 10.2298/FIL1612243D
– ident: CIT0005
  doi: 10.1016/j.jmaa.2014.01.068
– ident: CIT0035
  doi: 10.1088/0266-5611/22/6/007
– volume: 18
  start-page: 1891
  year: 2017
  ident: CIT0039
  publication-title: J Nonlinear Convex Anal
– ident: CIT0010
  doi: 10.1186/s13663-015-0376-4
– volume: 80
  start-page: 37
  issue: 3
  year: 2018
  ident: CIT0026
  publication-title: U Politeh Buch Ser A
– ident: CIT0028
  doi: 10.1080/02331934.2018.1491973
– ident: CIT0034
  doi: 10.1016/j.na.2011.03.044
– ident: CIT0002
  doi: 10.1007/s10957-014-0662-z
– volume: 16
  start-page: 587
  year: 2009
  ident: CIT0003
  publication-title: J Convex Anal
– ident: CIT0019
  doi: 10.1080/01630563.2016.1185614
– volume: 16
  start-page: 1965
  year: 2015
  ident: CIT0041
  publication-title: J Nonlinear Convex Anal
– ident: CIT0040
  doi: 10.22436/jnsa.009.06.58
– ident: CIT0012
  doi: 10.1080/02331934.2014.895898
– ident: CIT0032
  doi: 10.1088/0031-9155/51/10/001
– ident: CIT0023
  doi: 10.23952/jnva.2.2018.1.05
– ident: CIT0013
  doi: 10.1080/02331934.2017.1396603
– ident: CIT0020
  doi: 10.1186/s13660-015-0576-9
– volume: 18
  start-page: 925
  year: 2017
  ident: CIT0025
  publication-title: J Nonlinear Convex Anal
– ident: CIT0045
  doi: 10.1112/S0024610702003332
SSID ssj0021624
Score 2.4856865
Snippet In this paper, we present two new iterative algorithms for approximating a solution of the multiple-sets split feasibility problem. The suggested algorithms...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 269
SubjectTerms Algorithms
Feasibility
gradient method
iterative algorithm
Iterative algorithms
Multiple-sets split feasibility problem
projection
Title Gradient methods with selection technique for the multiple-sets split feasibility problem
URI https://www.tandfonline.com/doi/abs/10.1080/02331934.2019.1602772
https://www.proquest.com/docview/2352126804
Volume 69
WOSCitedRecordID wos000508986900004&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 & 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/eLvHCXMwrV07SwQxEA4iFlr4Fk9PSWEbvU1yeZQinhZyWChqtSS5BAQ55bIK_nsn2eyhiFhotyxMCJPJvPjyDUJHEEE8xL0BUcFRwis_IWZoGYFiCL5tUNpndv0rOR6r-3t9XdCEscAqUw0dWqKI7KvT5TY2doi4EwgzYDgsdUQqndojFFJE8MKQ2SdQ383obl5yVSKPtU0SJIl0b3h-WuVLdPrCXfrNV-cANFr7h62vo9WSfeLT1lw20IKfbqKVT5yEW-jhYpZRYA1uh0tHnFq1OOZ5OXCIeM76imHbGPJH3IESSfRNxBHS2gYHbwrw9h2XoTXb6HZ0fnN2Scr8BeKgcG2IdFrYQKk1lvNgKLMc8jUhOPz0VQiahyCEk0PNTBChMnbClHGCSRqgiglsBy1On6d-F2GprBwaJSdCaW64UTpY5wSke1xSO7E9xDu9166Qk6cZGU911XGYFs3VSXN10VwPHc_FXlp2jt8E9OdDrZvcFgntDJOa_SLb7yygLhc91pSlx89CDfjeH5beR8s01fEZDd5Hi83s1R-gJffWPMbZYTbpD9p78gc
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5aBfXgW6xWzcFrtJtNs9mjiLVi7aliPYUkm4AgVbqr4L93kt0tLSI96G1ZmBAmk8yDme9D6Bw8iAW_1ybCGUpYZDOiOjomkAzBt3YitQFdv58MBmI0SmdnYXxbpc-hXQkUEd5qf7l9MbpuibsEPwOWE_uSSJT6-giFGHEZrXh2Op-ADbtP06Qr4oHY1osQL1NP8fy2zJx_mkMv_fFaBxfU3fqPzW-jzSoAxVelxeygJTveRRszsIR76Pl2EhrBClzyS-fYV2txHihz4BzxFPgVw74xhJC47kskuS1ynENkW2BnVdV7-4Ur3pp99Ni9GV73SEXBQAzkrgVJTMq1o1QrzZhTNNYMQjbOGfy0kXMpc45zk4DmleMuUjqLhTI8TqiDRMbFB6gxfhvbQ4QToZOOEknGRcoUUyJ12hgOER9LqM50E7Fa8dJU-OSeJuNVRjWMaaU56TUnK8010cVU7L0E6FgkkM6eqixCZcSVNCYyXiDbqk1AVnc9lzT2889ctNnRH5Y-Q2u94UNf9u8G98donfq0PjSHt1CjmHzYE7RqPouXfHIa7PsbI_H2Kg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PSxwxFA51K9IebP1Rat1qDr1GnSSbSY6l7balsniwVE8hyeSBIKvsjAX_-75kMosi4sHehoEXwstL3nvhy_cR8gkzSMS8d8Q0BM5kFRvmJl4wbIbw24M2MbPrH9ezmT47MycFTdgWWGXqoaEnishnddrc1w0MiLhDTDMYOCLdiFQmXY9wLBFXyEssnScpsE-nf5Y9V6Wyrm0yYclmeMTz2DD30tM98tIHh3XOQNM3_2Hub8l6KT_p5z5eNsiLON8kr--QEm6R8--LDAPraK8u3dJ0V0vbLJiDq0iXtK8Up02xgKQDKpG1sWtpi3VtRyG6gry9pUW1Zpv8nn47_fKDFQEGFrBz7VgdjPLAuXdeSnBceIkFm1ISf8YKwEgApUI9McKBgsr5RmgXlKg5YBsD4h0Zza_m8T2htfb1xOm6UdpIJ5024ENQWO_JmvvG7xA5-N2Gwk6eRDIubTWQmBbP2eQ5Wzy3Qw6WZtc9PcdTBubuotou34tAL2JixRO24yECbNnpreUivX5W-kh-eMbQ-2Tt5OvUHv-c_dolr3jq6TMyfExG3eImfiSr4W930S72cnT_Az9h9Nw
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=Gradient+methods+with+selection+technique+for+the+multiple-sets+split+feasibility+problem&rft.jtitle=Optimization&rft.au=Yao%2C+Yonghong&rft.au=Postolache%2C+Mihai&rft.au=Zhu%2C+Zhichuan&rft.date=2020-02-01&rft.pub=Taylor+%26+Francis&rft.issn=0233-1934&rft.eissn=1029-4945&rft.volume=69&rft.issue=2&rft.spage=269&rft.epage=281&rft_id=info:doi/10.1080%2F02331934.2019.1602772&rft.externalDocID=1602772
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